El Metodo Del Espejo en La Loteria

http://www.lottoforums.
com/lottery/l
otto-tips-strategies/
http://oeis.org/wiki/Welcome#Some_
Famous_Sequences
Muchas personas dejan la eleccin de

los nmeros de su boleto de lotera
librada al azar. De hecho, cuando
juegas online, puedes dejar que el
sistema elija aleatoriamente los
nmeros de tu boleto. Otras personas
juegan siempre los mismos nmeros:
los de la suerte, las fechas de
cumpleaos de personas queridas, la
direccin de su casa
Sin embargo, podemos ayudar a la
suerte usando algunas estrategias para
elegir los nmeros de nuestro boleto
de lotera. Algunos de estos sistemas

requerirn que analicemos la
informacin disponible sobre los
sorteos anteriores.
Uno de los sistemas, por ejemplo,
consiste en elegir los nmeros en base
a la frecuencia con que han salido en
los sorteos anteriores. Si analizamos
las estadsticas de cualquier lotera,
podremos ver que hay ciertos nmeros
que se repiten ms que otros. A partir
de esa informacin, la eleccin es
nuestra: podemos armar nuestro
boleto con los que ms han salido, o
podemos elegir los nmeros que menos
salieron, ya que es probable que
comiencen a salir en algn momento.
Un anlisis de los resultados de los 12
meses anteriores bastar para darnos
un amplio panorama.
Hay otra estrategia de lotera
interesante que se llama la Rueda de
la Lotera. Esta estrategia nos permite
elegir los nmeros de la lotera de
acuerdo a un criterio determinado.
Existen 3 formatos de esta estrategia:

la Rueda completa, la abreviada y la
de nmero clave. La Rueda completa
nos dar todas las combinaciones
posibles dentro del rango de nmeros
elegidos. Por lo general, este mtodo
se usa cuando se juega entre varias
personas, ya que la cantidad de
combinaciones hace que se necesite
una gran inversin. Con la Rueda
abreviada obtendremos un nmero
menor de combinaciones. Con la Rueda
de nmero clave elegimos un nmero a
gusto, y obtenemos combinaciones en
las que aparezca ese nmero. Este es
el mtodo ms econmico y el ms
apropiado para jugar en forma
individual, por el monto de la apuesta.
La eleccin de los nmeros basada en
la numerologa es otra estrategia
popular. Sabemos que cada letra del
alfabeto se corresponde con un
nmero. La suma de los valores de las
letras de nuestro nombre, por
ejemplo, nos da una cifra
determinado. Podemos combinar

distintos nombres/cifras, para obtener
combinaciones para jugar a la lotera.
Estas son slo algunas de las
estrategias para jugar a la lotera.
Veremos muchas ms aqu en
Foroloteras.
GameBelgium Method
Hi people,
New poster. Tx to Admin for registering me and providing access.
I saw a method by GameBelgium with regards to selecting lines from the last 20
draws with no matches which peaked my interest. In it he was trying to select 6
lines which will have no matches in the next draw, and I thought it should be
easier as a starting point to select just 3 lines thus eliminating up to 15 numbers
(in our 5/45 game) and up to 18 numbers (in the 6/49 game). The number of
lines out in the 5/45 game for the last 10 draws were:
13,11,8,8,10,15,6,12,13,12, so between 6 and 15 lines with no matches at an
average of about 10 lines with no matches. Any ideas/suggestions on how to
choose 3 lines from the approximately 10 lines that won't have any matches?
Thanks
#2
11-09-2013, 11:05 AM
Icewynd
Registered User
Join Date: Aug 2010

Location: Canada & TX endless summer
Posts: 1,415
Hey Ramijami,
Welcome to the forum!

I also found Game Belgium's idea interesting and started to track the number of
matches in each of the previous 15 draws in my 6/49 game. What I have found is
that there is about a 0.6 probability of any of the previous 15 draws matching one
or more of the numbers in the most recent draw. For any draw between 2 and 10
of the previous 15 will have matches to the current draw, with an average of 6.3
draws out of the prior 15 having matches.
Therefore, your chances of getting 3 no-matches would be 0.42 (probability of a
non-match) to the third power, or 0.42 x 0.42 x 0.42 = 0.074. So you would be
successful about 7 times in 100 draws, or about once every 14 draws.
However, even in the worst case scenario where all three of your picks had
matches with the current draw, you might still only eliminate 3 of the drawn
numbers, as one match with the current draw is the most common outcome.
Why don't you do some testing on prior draws to see how it would work out?
Good luck!
#3
11-10-2013, 10:30 AM
Ramijami
Registered User
Join Date: Sep 2013

Location: Cape Town, South Africa
Posts: 63
Thanks Icewynd. Exploring the concept as a 3/20 game and using high/low, odd
even filters etc. to get a possible strategy. So far the best I'm doing is getting a
match in 5 or more sets. Trying to get a match consistently in 1-3 sets max. The
last few draws have eliminated 11-15 numbers in the 6/45, and 12-18 numbers in
the 6/49.
#4
11-10-2013, 11:13 AM
Icewynd
Registered User
Join Date: Aug 2010

Posts: 1,415
Quote:
Originally Posted by Ramijami

Thanks Icewynd. Exploring the concept as a 3/20 game and using high/low, odd
even filters etc. to get a possible strategy. So far the best I'm doing is getting a
match in 5 or more sets. Trying to get a match consistently in 1-3 sets max.
The last few draws have eliminated 11-15 numbers in the 6/45, and 12-18
numbers in the 6/49.
Hi Ramijami,
Not sure what you mean by 3/20 game -- are you trying to eliminate all but 20
numbers and hoping for a 3 match?
You might try searching this forum for "filters". I know PAB had a thread a while
back on this board than explored a large number of ways to filter the numbers.
Good luck!
#5
11-10-2013, 11:46 AM
Ramijami
Registered User
Join Date: Sep 2013

Posts: 63
Hi Icewynd,
By 3/20 I mean choosing 3 lines of the 20 which I think won't have any matches
#6
11-10-2013, 12:01 PM
Icewynd
Registered User
Join Date: Aug 2010

Posts: 1,415
Thanks for the explanation.

I had a thought about which games you might pick to have no matches with the
next draw. We know that games in the previous 15 draws will have no matches
with the current draw about 4 times out of 10 draws. So, I would pick games that
have had a higher than average percentage of matches lately. For example, if the
5th prior game had matched at least one of the current draw numbers 8 out of
the last 10 draws, then it would be a good candidate for a miss, to return to its
expected average in the spirit of 'regression to the mean'.
Good luck!
#7
11-19-2013, 07:30 AM
GameBelgium
Registered User
Join Date: Oct 2007

Posts: 88
Hi Ramijami
Picking 3 lines from 20 will give you a reduced amount of numbers to play. It will
probably give you 13 to 15 numbers which you should not play in the next draw.
However, in most cases, that will be all it gives you. If you want to use the
information to further eliminate numbers and provide you with a limited pool of
numbers containing the winning numbers, you will need to select more lines (if
you think this through, it makes perfect sense, doesn't it?). I applied the principle
to Euro Millions (a 5/50 lottery) and if I remember correctly, on average, 13 (!)
lines from the last 20 draws contained no matches.
Anyway, let us know how you do and if you're succesful in selecting the 3 lines
correctly on a regular basis, please share how you got there, and maybe we can
make it a work in progress.
Best of luck!
#8
11-19-2013, 10:07 PM
Join Date: May 2003
TheWasp
Posts: 5
Registered User
In my 649 lotto, I've found that typically there will be 23 lines from the last 72
draws that will not have the numbers that show in the next draw. This can vary
from a low of 17 to a high of 27 and not always will it just be the next 7 numbers,
it could be as many as 10. Of course, generating this set will produce a lot of
numbers that qualify and I've found that one needs to include some other info
about the last numbers to make it work to some degree of reliability.
#9
11-20-2013, 12:25 PM
Icewynd
Registered User
Join Date: Aug 2010

Posts: 1,415
I did some further investigation into this problem.

What I did was divide the previous games into 3 groups: last 5 games, games 610 prior and games 11-15 prior.
I then counted how many of the 5 draws in each group had at least one match
with the current draw.
The percentages were quite consistent across all 3 groups, as one would expect
from a random distribution.
The most common outcome, occurring 33% of the time was that 3 draws of each
group would have a match with the current draw, with the other 2 in the group
having no match.
Next most common, occurring 28% of the time, was that 2 draws in each group
would have a match with the current draw, with the other 3 in the group having
no match.
Another 33% had 4 or 5 games from the group of 5 having at least one match,
while the remaining 6% of draws had 1 or 2 games with matches from the group
of 5 with the remaining 3 or 4 games in the group having no match.
Zero matches from a group of 5 draws were very rare.
So, if you deleted the prior 5 games, there is a 62% chance that you will delete 2
or 3 sets of numbers that will have one or two matches with the upcoming draw
while 12 (2X6) or 18(3X6) numbers will be successfully deleted.
Only about 6% of the time you could delete the last 5 games and have only one
game with a match (most often 1 match of six).
Good luck!
Hello Pab:
You are the teacher, not I, but Ill try to help.
I think that the way would be something like that:
1 -Go to the page of all the series:
http: // oeis.org/wiki/Index_to_OEIS: _
Section_Se*sequences_which_agree_for_a_long_time
2 -We search in the the thousands of possible series the one that we are
interested for our game.
For example. A002048:
The serie it consists these numbers between 1 and 49:
1, 2, 4, 5, 8, 10, 14, 15, 16, 21, 22, 25, 26, 28, 33, 34, 35, 36, 38, 40, 42, 46, 48,
49
3 -Now is when you can analize how many numbers of this serie, they appear
normally in every combination.
This page has thousands of possible filters (so many as series), because of it I said
you that there is a lot of information with possibilities of being applied.
Regards
Hints
Search
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.

(Formerly M0692 N0256)
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181,
6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040,
1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817,
(list; graph; refs; listen; history; text; internal format)
Also called Lam's sequence.

F(n+2) = number of binary sequences of length n that have no consecutive 0's.
F(n+2) = number of subsets of {1,2,...,n} that contain no consecutive integers.
F(n+1) = number of tilings of a 2 X n rectangle by 2 X 1 dominoes.
F(n+1) = number of matchings in a path graph on n vertices: F(5)=5 because the
matchings of the path graph on the vertices A, B, C, D are the empty set, {AB},
{BC}, {CD} and {AB, CD}. - Emeric Deutsch, Jun 18 2001
F(n) = number of compositions of n+1 with no part equal to 1. [Cayley, Grimaldi]
Positive terms are the solutions to z = 2*x*y^4 + (x^2)*y^3 - 2*(x^3)*y^2 - y^5 (x^4)*y + 2*y for x,y >= 0 (Ribenboim, page 193). When x=F(n), y=F(n + 1) and z>0
then z=F(n + 1).
For Fibonacci search see Knuth, Vol. 3; Horowitz and Sahni; etc.
F(n) is the diagonal sum of the entries in Pascal's triangle at 45 degrees slope.
Amarnath Murthy, Dec 29 2001
F(n+1) is the number of perfect matchings in ladder graph L_n = P_2 X P_n. - Sharon
Sela (sharonsela(AT)hotmail.com), May 19 2002
F(n+1) = number of (3412,132)-, (3412,213)- and (3412,321)-avoiding involutions in
This is also the Horadam sequence (0,1,1,1). - Ross La Haye, Aug 18 2003
An INVERT transform of A019590. INVERT([1,1,2,3,5,8,...]) gives A000129.
INVERT([1,2,3,5,8,13,21,...]) gives A028859. - Antti Karttunen, Dec 12 2003
Number of meaningful differential operations of the k-th order on the space R^3.
Branko Malesevic, Mar 02 2004

F(n)=number of compositions of n-1 with no part greater than 2. Example: F(4)=3
because we have 3 = 1+1+1=1+2=2+1.
F(n) = number of compositions of n into odd parts; e.g., F(6) counts 1+1+1+1+1+1,
1+1+1+3, 1+1+3+1, 1+3+1+1, 1+5, 3+1+1+1, 3+3, 5+1. - Clark Kimberling, Jun 22 2004
F(n) = number of binary words of length n beginning with 0 and having all runlengths
odd; e.g., F(6) counts 010101, 010111, 010001, 011101, 011111, 000101, 000111,
000001. - Clark Kimberling, Jun 22 2004
The number of sequences (s(0),s(1),...s(n)) such that 0<s(i)<5, |s(i)-s(i-1)|=1 and
s(0)=1 is F(n+1); e.g., F(5+1) = 8 corresponds to 121212, 121232, 121234, 123212,
123232, 123234, 123432, 123434. - Clark Kimberling, Jun 22 2004. [Corrected by
Neven Juric, Jan 09 2009]
Likewise F(6+1) = 13 corresponds to these thirteen sequences with seven numbers:
1212121, 1212123, 1212321, 1212323, 1212343, 1232121, 1232123, 1232321, 1232323,
1232343, 1234321, 1234323, 1234343. - Neven Juric, Jan 09 2008
A relationship between F(n) and the Mandelbrot set is discussed in the link "Le
nombre d'or dans l'ensemble de Mandelbrot" (in French). - Gerald McGarvey, Sep 19
For n>0, the continued fraction for F(2n-1)*Phi=[F(2n);L(2n-1),L(2n-1),L(2n-1),...]

and the continued fraction for F(2n)*Phi=[F(2n+1)-1;1,L(2n)-2,1,L(2n)-2,...]. Also
true: F(2n)*Phi=[F(2n+1);-L(2n),L(2n),-L(2n),L(2n),...] where L(i) is the i-th
Lucas number (A000204).... - Clark Kimberling, Nov 28 2004. [Corrected byHieronymus
Fischer, Oct 20 2010]
F(n) = number of permutations p of 1,2,3,...,n such that |k-p(k)|<=1 for k=1,2,...,n.
(For <=2 and <=3, see A002524 and A002526.) - Clark Kimberling, Nov 28 2004
The ratios F(n+1)/F(n) for n>0 are the convergents to the simple continued fraction
expansion of the golden section. - Jonathan Sondow, Dec 19 2004
Lengths of successive words (starting with a) under the substitution: {a -> ab, b ->
a}. - Jeroen F.J. Laros, Jan 22 2005
The Fibonacci sequence, like any additive sequence, naturally tends to be geometric
with common ratio not a rational power of 10; consequently, for a sufficiently
large number of terms, Benford's law of first significant digit (i.e., first digit
1 =< d =< 9 occurring with probability log_10(d+1) - log_10(d)) holds. -Lekraj
Beedassy, Apr 29 2005
a(n) = Sum(abs(A108299(n, k)): 0 <= k <= n). - Reinhard Zumkeller, Jun 01 2005
A001222(A000304(n)).
Fib(n+2)=sum(k=0..n, binomial(floor((n+k)/2),k)), row sums of A046854. - Paul Barry
Mar 11 2003
Number of order ideals of the "zig-zag" poset. See vol. 1, ch. 3, prob. 23 of
Stanley. - Mitch Harris, Dec 27 2005
F(n+1)/F(n) is also the Farey fraction sequence (see A097545 for explanation) for the
golden ratio, which is the only number whose Farey fractions and continued
fractions are the same. - Joshua Zucker, May 08 2006
a(n+2) is the number of paths through 2 plates of glass with n reflections
(reflections occurring at plate/plate or plate/air interfaces). Cf. A006356A006359. - Mitch Harris, Jul 06 2006
F(n+1) equals the number of downsets (i.e., decreasing subsets) of an n-element
fence, i.e., an ordered set of height 1 on {1,2,...,n} with 1 > 2 < 3 > 4 < ... n
and no other comparabilities. Alternatively, F(n+1) equals the number of subsets A
of {1,2,...,n} with the property that, if an odd k is in A, then the adjacent
elements of {1,2,...,n} belong to A, i.e., both k - 1 and k + 1 are in A (provided
they are in {1,2,...,n}). - Brian Davey, Aug 25 2006
Number of Kekule structures in polyphenanthrenes. See the paper by Lukovits and
Janezic for details. - Parthasarathy Nambi, Aug 22 2006
Inverse: With phi = (sqrt(5) + 1)/2, round(log_phi(sqrt((sqrt(5) a(n) + sqrt(5 a(n)^2
- 4))(sqrt(5) a(n) + sqrt(5 a(n)^2 + 4)))/2)) = n for n >= 3, obtained by rounding
the arithmetic mean of the inverses given in A001519 and A001906. - David W.
Cantrell (DWCantrell(AT)sigmaxi.net), Feb 19 2007
A result of Jacobi from 1848 states that every symmetric matrix over a p.i.d. is
congruent to a triple-diagonal matrix. Consider the maximal number T(n) of summands
in the determinant of an n X n triple-diagonal matrix. This is the same as the
number of summands in such a determinant in which the main-, sub- and superdiagonal elements are all nonzero. By expanding on the first row we see that the
sequence of T(n)'s is the Fibonacci sequence without the initial stammer on the
1's. - Larry Gerstein (gerstein(AT)math.ucsb.edu), Mar 30 2007
Suppose psi=log(phi). We get the representation F(n)=(2/sqrt(5))*sinh(n*psi) if n is
even; F(n)=(2/sqrt(5))*cosh(n*psi) if n is odd. There is a similar representation
for Lucas numbers (A000032). Many Fibonacci formulas now easily follow from
appropriate sinh- and cosh-formulas. For example: the de Moivre theorem (cosh(x)
+sinh(x))^m=cosh(mx)+sinh(mx) produces L(n)^2+5F(n)^2=2L(2n) and L(n)F(n)=F(2n)
(setting x=n*psi and m=2). - Hieronymus Fischer, Apr 18 2007
Inverse: floor(log_phi(sqrt(5)*Fib(n))+0.5)=n, for n>1. Also for n>0,
floor(1/2*log_phi(5*Fib(n)*Fib(n+1)))=n. Extension valid for integer n, except
n=0,-1: floor(1/2*sign(Fib(n)*Fib(n+1))*log_phi|5*Fib(n)*Fib(n+1)|)=n (where
sign(x) = sign of x). - Hieronymus Fischer, May 02 2007
F(n+2) = The number of Khalimsky-continuous functions with a two-point codomain. Shiva Samieinia (shiva(AT)math.su.se), Oct 04 2007
From Kauffman and Lopes, Proposition 8.2, p. 21: "The sequence of the determinants of
the Fibonacci sequence of rational knots is the Fibonacci sequence (of numbers)."
Jonathan Vos Post, Oct 26 2007
This is a_1(n) in the Doroslovacki reference.
Let phi = 1.6180339...; then phi^n = (1/phi)*a(n) + a(n+1). Example: phi^4 =
6.8541019...= (.6180339...)*3 + 5. Also phi = 1/1 + 1/2 + 1/(2*5) + 1/(5*13) + 1/
(13*34) + 1/(34*89),... - Gary W. Adamson, Dec 15 2007
The sequence of first differences, fib(n+1)-fib(n), is essentially the same sequence:
1, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ... - Colm Mulcahy, Mar 03 2008
a(n)= the number of different ways to run up a staircase with n steps, taking steps
of odd sizes where the order is relevant and there is no other restriction on the
number or the size of each step taken. - Mohammad K. Azarian, May 21 2008
Equals row sums of triangle A144152. - Gary W. Adamson, Sep 12 2008
Except for the initial term, the numerator of the convergents to the recursion x = 1/
(x+1). - Cino Hilliard, Sep 15 2008
F(n) is the number of possible binary sequences of length n that obey the sequential
construction rule: if last symbol is 0, add the complement (1); else add 0 or 1.
Here 0,1 are metasymbols for any 2-valued symbol set. This rule has obvious
similarities to JFJ Laros's rule, but is based on addition rather than substitution
and creates a tree rather than a single sequence. - Ross Drewe, Oct 05 2008
F(n) = PRODUCT_{k=1, (n-1)/2} (1 + 4*cos^2 k*Pi/n); where terms = roots to the
Fibonacci product polynomials, A152063. - Gary W. Adamson, Nov 22 2008
Fp == 5^((p-1)/2) mod p, p = prime; [Schroeder, p. 90]. - Gary W. Adamson &Alexander
R. Povolotsky, Feb 21 2009
(Ln)^2 - 5*(Fn)^2 = 4*(-1)^n. Example: 11^2 - 5*5 = -4. - Gary W. Adamson, Mar 11
Output of Kasteleyn's formula for the number of perfect matchings of an m x n grid

specializes to the Fibonacci sequence for m=2. - Sarah-Marie Belcastro
(smbelcas(AT)toroidalsnark.net), Jul 04 2009
(Fib(n),Fib(n+4)) satisfies the Diophantine equation: X^2 + Y^2 - 7XY = 9*(-1)^n. Mohamed Bouhamida (bhmd95(AT)yahoo.fr), Sep 06 2009
(Fib(n),Fib(n+2)) satisfies the Diophantine equation: X^2 + Y^2 - 3XY = (-1)^n. Mohamed Bouhamida (bhmd95(AT)yahoo.fr), Sep 08 2009
a(n+2)=A083662(A131577(n)). - Reinhard Zumkeller, Sep 26 2009
Difference between of number of closed walks of length n+1 from a node on a pentagon
and number of walks of length n+1 between two adjacent nodes on a pentagon. -
Bottomley, Feb 10 2010

F(n+1) = number of Motzkin paths of length n having exactly one weak ascent. A
Motzkin path of length n is a lattice path from (0,0) to (n,0) consisting of
U=(1,1), D=(1,-1) and H=(1,0) steps and never going below the x-axis. A weak ascent
in a Motzkin path is a maximal sequence of consecutive U and H steps. Example:
a(5)=5 because we have (HHHH), (HHU)D, (HUH)D, (UHH)D, and (UU)DD (the unique weak
ascent is shown between parentheses; see A114690). - Emeric Deutsch, Mar 11 2010
(F(n-1)+F(n+1))^2 - 5F(n-2)*F(n+2) = 9*(-1)^n. - Mohamed Bouhamida
(bhmd95(AT)yahoo.fr), Mar 31 2010
From the Pinter and Ziegler reference's abstract: authors "show that essentially the
Fibonacci sequence is the unique binary recurrence which contains infinitely many
three-term arithmetic progressions. A criterion for general linear recurrences
having infinitely many three-term arithmetic progressions is also given."
Jonathan Vos Post, May 22 2010
F(n+1) = number of paths of length n starting at initial node on the path graph P_4.
Johannes W. Meijer, May 27 2010
F(k) = Number of cyclotomic polynomials in denominator of generating function for
number of ways to place k nonattacking queens on an n X n board. - Vaclav
Kotesovec, Jun 07 2010
As n-> inf., (a(n)/a(n-1) - a(n-1)/a(n)) tends to 1.0. Example: a(12)/a(11) a(11)/a(12) = 144/89 - 89/144 = .99992197.... - Gary W. Adamson, Jul 16 2010
Hieronymus Fischer, Oct 20 2010: (Start)
Fibonacci numbers are those numbers m such that m*phi is closer to an integer than
k*phi for all k, 1<=k<m. More formally: a(0)=0, a(1)=1, a(2)=1, a(n+1)=minimal
m>a(n) such that m*phi is closer to an integer than a(n)*phi.
For all numbers 1<=k<Fib(n), the inequality |k*phi-round(k*phi)| > |Fib(n)*phiround(Fib(n)*phi)| holds.
Fib(n)*phi - round(Fib(n)*phi) = -((-phi)^(-n)), for n>1.
fract(0.5+Fib(n)*phi) = 0.5 -(-phi)^(-n), for n>1.
fract(Fib(n)*phi) = (1/2)*(1+(-1)^n)-(-phi)^(-n), n>1.
Inverse: n = -log_phi |0.5-fract(0.5+Fib(n)*phi)|. (End)
A001177(n)*k) mod n = 0, for any integer k. - Gary Detlefs, Nov 27 2010
F(n+k)^2-F(n)^2 = F(k)*F(2n+k), for even k. - Gary Detlefs, Dec 04 2010
F(n+k)^2+F(n)^2 = F(k)*F(2n+k), for odd k. - Gary Detlefs, Dec 04 2010
"Even the Fibonacci sequence - 1,1,2,3,5,8,13 - follows Benford's law." See Pickover.
F(n) = round(phi* F(n-1)) for n>1. - Joseph P. Shoulak, Jan 13 2012
For n > 0: a(n) = length of n-th row in Wythoff array A003603. - Reinhard Zumkeller
Jan 26 2012
Bridget Tenner, Feb 22, 2012: (Start)
The number of free permutations of [n].
The number of permutations of [n] for which s_k in supp(w) implies s_{k+-1} not in
supp(w).
The number of permutations of [n] in which every decomposition into length(w)
reflections is actually composed of simple reflections. (End)
The sequence F(n+1)^(1/n) is increasing. The sequence F(n+2)^(1/n) is decreasing.
Thomas Ordowski, Apr 19 2012
Two conjectures: For n > 1, F(n+2)^2 mod F(n+1)^2 = F(n)*F(n+1) - (-1)^n. For n > 0,
(F(2n) + F(2n+2))^2 = F(4n+3) + sum_{k = 2..2n}F(2k). - Alex Ratushnyak, May 06
Ravi Kumar Davala, Jan 30 2014, (Start)

Proof of Ratushnyak's first conjecture: For n > 1, F(n+2)^2 - F(n)*F(n+1)
2F(n+1)^2.
+ (-1)^n =
Consider: F(n+2)^2 - F(n)*F(n+1) - 2F(n+1)^2

= F(n+2)^2 - F(n+1)^2 - F(n+1)^2 - F(n)*F(n+1)
=(F(n+2) + F(n+1))*(F(n+2) - F(n+1)) - F(n+1)*(F(n+1) + F(n))
= F(n+3)*F(n) - F(n+1)*F(n+2) = -(-1)^n.
Proof of second conjecture: L(n) stands for Lucas number sequence from A000032.
consider the fact
L(2n+1)^2 = L(4n+2) - 2
(F(2n) + F(2n+2))^2 = F(4n+1) + F(4n+3) - 2
(F(2n) + F(2n+2))^2 = sum{k = 2..2n, F(2k)} + F(4n+3). (end)
The relationship: INVERT transform of (1,1,0,0,0,...) = (1, 2, 3, 5, 8,...), while
the INVERT transform of (1,0,1,0,1,0,1,...) = (1, 1, 2, 3, 5, 8,...) is equivalent
to: The numbers of compositions using parts 1 and 2 is equivalent to the numbers of
compositions using parts == 1 mod 2 (i.e., the odd integers). Generally, the
numbers of compositions using parts 1 and k is equivalent to the numbers of

compositions of (n+1) using parts 1 mod k. Cf. A000930 for k = 3 andA003269 for k =
4. Example: for k = 2, n = 4 we have the compositions (22; 211, 121; 112; 1111) =
5; but using parts 1 and 3 we have for n = 5: (311, 131, 113, 11111, 5) = 5. W. Adamson, Jul 05 2012
The sequence F(n) is the binomial transformation of the alternating sequence (-1)^(n1)*F(n), whereas the sequence F(n+1) is the binomial transformation of the
alternating sequence (-1)^n*F(n-1). Both of these facts follow easily from the
equalities a(n;1)=F(n+1) and b(n;1)=F(n) where a(n;d) and b(n;d) are so-called
"delta-Fibonacci" numbers as defined in comments to A014445 (see also Witula et
al.'s papers). - Roman Witula, Jul 24 2012
F(n) is the number of different (n-1)-digit binary numbers such that all substrings
of length > 1 have at least one digit equal to 1. Example: for n = 5 there are 8
binary numbers with n - 1 = 4 digits (1000, 1001, 1010, 1011, 1100, 1101, 1110,
1111), only the F(n) = 5 numbers 1010, 1011, 1101, 1110 and 1111 have the desired
property. - Hieronymus Fischer, Nov 30 2012
For positive n, F(n+1) equals the determinant of the n X n tridiagonal matrix with
1's along the main diagonal, i's along the superdiagonal and along the subdiagonal
where i = sqrt(-1). Example: Det([1,i,0,0; i,1,i,0; 0,i,1,i; 0,0,i,1]) = F(4+1) =
Philippe Delham, Feb 24 2013
For n>=1, number of compositions of n where there is a drop between every second pair
of parts, starting with the first and second part; see example. Also, a(n+1) is the
number of compositions where there is a drop between every second pair of parts,
starting with the second and third part; see example. - Joerg Arndt, May 21 2013
Central terms of triangles in A162741 and A208245, n > 0. - Reinhard Zumkeller, Jul
28 2013
For n>=4, F(n-1) is the number of simple permutations in the geometric grid class
given in A226433. - Jay Pantone, Sep 08 2013
Wolfdieter Lang, Oct 01 2013: (Start)
a(n) are the pentagon (not pentagonal) numbers because the algebraic degree 2 number
rho(5) = 2*cos(pi/5) = phi (golden section), the length ratio diagonal/side in a
pentagon, has minimal polynomial C(5,x) = x^2 - x - 1 (seeA187360, n=5), hence
rho(5)^n = a(n-1)*1 + a(n)*rho(5), n >= 0, in the power basis of the algebraic
number field Q(rho(5)). One needs a(-1) = 1 here. See also the P. Steinbach
reference under A049310. (End)
A010056(a(n)) = 1. - Reinhard Zumkeller, Oct 10 2013
Define F(-n) to be F(n) for n odd and -F(n) for n even. Then for all n and k,
F(n+2k)^2 - F(n)^2 = F(n+k)*( F(n+3k) - F(n-k) ). - Charlie Marion, Dec 20 2013
( F(n), F(n+2k) ) satisfies the Diophantine equation: X^2 + Y^2 - L(2k)*X*Y =
F(4k)^2*(-1)^n. This generalizes Bouhamidas comments dated Sep 06 2009 and Sep 08
2009. - Charlie Marion, Jan 07 2014

For any prime p there is an infinite periodic subsequence within F(n) divisible by p,
that begins at index n = 0 with value 0, and its first nonzero term at n
A001602(i), and period k = A001602(i). Also see A236479. - Richard R. Forberg
26 2014
Range of row n of the circular Pascal array of order 5. - Shaun V. Ault, May 30 2014
(orig. Kicey-Klimko 2011, and observations by Glen Whitehead. More general work
found in Ault-Kicey 2014.)
Nonnegative range of the quintic polynomial 2*y - y^5 + 2*x*y^4 + x^2*y^3 - 2*x^3*y^2
- x^4*y with x, y >= 0, see Jones 1975. - Charles R Greathouse IV, Jun 01 2014
The expression round(1/(F(k+1)/F(n) + F(k)/F(n+1))), for n > 0, yields a Fibonacci
sequence with k-1 leading zeros (with rounding 0.5 to 0). - Richard R. Forberg
04 2014
Abrate, Marco; Barbero, Stefano; Cerruti, Umberto; Murru, Nadir. Colored

compositions, Invert operator and elegant compositions with the "black tie''.
Discrete Math. 335 (2014), 1--7. MR3248794
Andrews, George E. Fibonacci numbers and the Rogers-Ramanujan identities. Fibonacci
Quart. 42 (2004), no. 1, 3--19. MR2060558(2005b:11161)
S. V. Ault and C. Kicey, Counting paths in corridors using circular Pascal arrays,
Discrete Mathematics (2014).
Mohammad K. Azarian, The Generating Function for the Fibonacci Sequence, Missouri
Journal of Mathematical Sciences, Vol. 2, No. 2, Spring 1990, pp. 78-79.
Zentralblatt MATH, Zbl 1097.11516.
Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem II, Missouri
Journal of Mathematical Sciences, Vol. 16, No. 1, Winter 2004, pp. 12-17.
Mohammad K. Azarian, Fibonacci Identities as Binomial Sums, International Journal of
Contemporary Mathematical Sciences, Vol. 7, No. 38, 2012, pp. 1871-1876.
Mohammad K. Azarian, Fibonacci Identities as Binomial Sums II, International Journal
of Contemporary Mathematical Sciences, Vol. 7, No. 42, 2012, pp. 2053-2059.
Mohammad K. Azarian, Identities Involving Lucas or Fibonacci and Lucas Numbers as
Binomial Sums, International Journal of Contemporary Mathematical Sciences, Vol. 7,
No. 45, 2012, pp. 2221-2227.
P. Bachmann, Niedere Zahlentheorie (1902, 1910), reprinted Chelsea, NY, 1968, vol. 2,
p. 70.
R. B. Banks, Slicing Pizzas, Racing Turtles and Further Adventures in Applied
Mathematics, Princeton Univ. Press, 1999. See p. 84.

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial
proof, M.A.A. 2003, id. 4.
Majorie Bicknell and Verner E Hoggatt, Fibonacci's Problem Book, Fibonacci
Association, San Jose, Calif., 1974.
S. Brlek, E. Duchi, E. Pergola and S. Rinaldi, On the equivalence problem for
succession rules, Discr. Math., 298 (2005), 142-154.
N. D. Cahill and D. A. Narayan. "Fibonacci and Lucas Numbers as Tridiagonal Matrix
Determinants". Fibonacci Quarterly, 42(3):216-221, 2004.
A. Cayley, Theorems in Trigonometry and on Partitions, Messenger of Mathematics, 5
(1876), pp. 164,188 = Mathematical Papers Vol. 10, n. 634, p. 16.
Hongwei Chen, Evaluations of Some Variant Euler Sums, Journal of Integer Sequences,
Vol. 9 (2006), Article 06.2.3.
D. Chmiela, K. Kaczmarek, R. Witula, Binomials Transformation Formulae of Scaled
Fibonacci Numbers (submitted 2012).
Paul Cubre, The Z-densities of the Fibonacci sequence, M. A. Thesis, Wake Forest
University, May 2012;
http://wakespace.lib.wfu.edu/bitstream/handle/10339/37313/Cubre_wfu_0248M_10299.pdf
B. A. Davey and H. A. Priestley, Introduction to Lattices and Order (2nd edition),
CUP, 2002. (See Exercise 1.15.)
B. Davis, 'The law of first digits' in 'Science Today'(subsequently renamed '2001')
March 1980 pp. 55, Times of India, Mumbai.
A.-S. Elsenhans and J. Jahnel, The Fibonacci sequence modulo p^2 - an investigation
by computer for p < 10^14, http://www.uni-math.gwdg.de/tschinkel/gauss/Fibon.pdf
Nathaniel D. Emerson, A Family of Meta-Fibonacci Sequences Defined by Variable-Order
Recursions, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.8.
Reinhardt Euler, The Fibonacci Number of a Grid Graph and a New Class of Integer
Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.2.6.
Helaman and Claire Ferguson, "Celebrating Mathematics in Stone and Bronze", Notices
of the American Mathematical Society, 57 (2010), 840-850. See page 844.
Emmanuel Ferrand, Deformations of the Taylor Formula, Journal of Integer Sequences,
Vol. 10 (2007), Article 07.1.7.
S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.2.
R. P. Grimaldi, Compositions without the summand 1, Proceedings Thirty-second
Southeastern International Conference on Combinatorics, Graph Theory and Computing

(Baton Rouge, LA, 2001). Congr. Numer. 152 (2001), 33-43.
N. S. S. Gu, N. Y. Li and T. Mansour, 2-Binary trees: bijections and related issues,
Discr. Math., 308 (2008), 1209-1221.
H. Halberstam and K. F. Roth, Sequences, Oxford, 1966; see Appendix.
S. Happersett, "Mathematical meditations", Journal of Mathematics and the Arts, 1
(2007), 29 - 33.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed.,
Oxford Univ. Press, 1954; see esp. p. 148.
J. Hermes, Anzahl der Zerlegungen einer ganzen rationalen Zahl in Summanden, Math.
Ann., 45 (1894), 371-380.
V. E. Hoggatt and C. T. Long. "Divisibility Properties of Generalized Fibonacci
Polynomials"; Fibonacci Quarterly, 12:113-130, 1974.
V. E. Hoggatt, Jr., Fibonacci and Lucas Numbers. Houghton, Boston, MA, 1969.
E. Horowitz and S. Sahni, Fundamentals of Data Structures, Computer Science Press,
1976; p. 338.
C. W. Huegy and D. B. West, A Fibonacci tiling of the plane, Discrete Math., 249
(2002), 111-116.
P. W. Kasteleyn, The statistics of dimers on a lattice. I. The number of dimer
arrangements on a quadratic lattice, Physica, 27(1961), 1209-1225.
M. Kauers and P. Paule, The Concrete Tetrahedron, Springer 2011, p. 63.
C. Kicey and K. Klimko, Some geometry of Pascal's triangle, Pi Mu Epsilon Journal,
13(4):229-245 (2011).
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 1, p.
78; Vol. 3, Section 6.2.1.
Thomas Koshy, "Fibonacci and Lucas Numbers with Applications", John Wiley and Sons,
2001.
Lukovits et al., Nanotubes: Number of Kekule structures and aromaticity, J. Chem.
Inf. Comput. Sci, (2003), vol. 43, 609-614. See eq. 2 on page 610.
I. Lukovits and D. Janezic, "Enumeration of conjugated circuits in nanotubes", J.
Chem. Inf. Comput. Sci., vol. 44, 410-414 (2004). See Table 1, second column.
B. Malesevic: Some combinatorial aspects of differential operation composition on the
space R^n, Univ. Beograd, Publ. Elektrotehn. Fak., Ser. Mat. 9 (1998), 29-33.
G. Mantel, Resten van wederkeerige Reeksen, Nieuw Archief v. Wiskunde, 2nd series, I
(1894), 172-184.
A. Milicevic and N. Trinajstic, "Combinatorial Enumeration in Chemistry", Chem.
Modell., Vol. 4, (2006), pp. 405-469.
Ram Krishna Pandey, "On Some Magnified Fibonacci Numbers Modulo a Lucas Number",
Journal of Integer Sequences, Vol. 16 (2013), #13.1.7.
Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 49.
Clifford A. Pickover, The Math Book, From Pythagoras to the 57th Dimension, 250
Milestones in the History of Mathematics, Sterling Publ., NY, 2009, page 274.
A. S. Posamentier & I. Lehmann, The Fabulous Fibonacci Numbers, Prometheus Books,
Amherst, NY 2007.
P. Ribenboim, The New Book of Prime Number Records, Springer, 1996.
J. Riordan, An Introduction to Combinatorial Analysis, Princeton University Press,
Princeton, NJ, 1978.
A. M. Robert, A Course in p-adic Analysis, Springer-Verlag, 2000; p. 213.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 288.
A. Sapounakis, I. Tasoulas and P. Tsikouras, On the Dominance Partial Ordering of
Dyck Paths, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.5.
Manfred R. Schroeder, "Number Theory in Science and Communication", 5th ed.,
Springer-Verlag, 2009
Mark A. Shattuck, Tiling proofs of some formulas for the Pell numbers of odd index,
Integers, 9 (2009), 53-64.
Simson, [No first name given], An explanation of an obscure passage in Albert
Girard's Commentary ..., Phil. Trans. Royal Soc., 10 (1753), 430-433.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this
sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic
Press, 1995 (includes this sequence).
S. Vajda, Fibonacci and Lucas numbers and the Golden Section, Ellis Horwood Ltd.,
Chichester, 1989.
N. N. Vorob'ev, Chisla fibonachchi [Russian], Moscow, 1951. English translation,
Fibonacci Numbers, Blaisdell, New York and London, 1961.
N. N. Vorobiev, Fibonacci Numbers, Birkhauser (Basel;Boston) 2002.

D. Wells, The Penguin Dictionary of Curious and Interesting Numbers, pp. 61-7,
Penguin Books 1987.
R. Witula, D. Slota, delta-Fibonacci Numbers, Appl. Anal. Discrete Math., 3 (2009),
310-329.
N. J. A. Sloane, The first 2000 Fibonacci numbers: Table of n, F(n) for n = 0..2000
Amazing Mathematical Object Factory, Information on the Fibonacci sequences
M. Anderson et al., The Fibonacci Series
Matt Anderson, Jeffrey Frazier and Kris Popendorf, The Fibonacci series: the
successor formula
Matt Anderson, Jeffrey Frazier and Kris Popendorf, The Fibonacci series: the section
index
P. G. Anderson, Fibonacci Facts
Joerg Arndt, Matters Computational (The Fxtbook)
J.-L. Baril, Classical sequences revisited with permutations avoiding dotted pattern
Electronic Journal of Combinatorics, 18 (2011), #P178.
Paul Barry, A Catalan Transform and Related Transformations on Integer Sequences
Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.5.
Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles
Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.
J. Bodeen, S. Butler, T. Kim, X. Sun, S. Wang, Tiling a strip with triangles, El. J.
Combinat. 21 (1) (2014) P1.7
H. Bottomley and N. J. A. Sloane, Illustration of initial terms: the Fibonacci tree
Brantacan, Fibonacci Numbers
J. Britton & B. V. Eeckhout, Fibonacci Interactive
N. D. Cahill, J. R. D'Errico, J. P. Spence, Complex factorizations of the Fibonacci
and Lucas numbers, Fib. Quart. 41 (2003) 13
C. K. Caldwell, The Prime Glossary, Fibonacci number
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs.
Vol. 3 (2000), #00.1.5.

E. S. Croot, Notes on Linear Recurrence Sequences
C. Dement, Posting to Math Forum.
R. M. Dickau, Fibonacci numbers
R. Doroslovacki, Binary sequences without 011...110 (k-1 1's) for fixed k, Mat.
Vesnik 46 (1994), no. 3-4, 93-98.
Enthios LLC, Fibonacci Primer
G. Everest, A. J. van der Poorten, Y. Puri and T. Ward, Integer Sequences and
Periodic Points, Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.3
G. Everest, A. van der Poorten, I. Shparlinski and T. Ward, Recurrence Sequences,
Amer. Math. Soc., 2003; see esp. p. 255. MR1990179
Philipp Fahr and Claus Michael Ringel, Categorification of the Fibonacci Numbers
Using Representations of Quivers
John Farrier, Fibonacci Pigeons [From Sarah Spolaor, Sep 30 2010]
Helaman and Claire Ferguson, Celebrating Mathematics in Stone and Bronze
D. Foata and G.-N. Han, Nombres de Fibonacci et polynomes orthogonaux,
I. Galkin, "Fibonacci Numbers Spelled Out"
Dale Gerdemann, Video of Fibonacci tree
Dale Gerdemann, Video of Fibonacci tree(s) (another version)
Dale Gerdemann, Golden Ratio Base Contains Zeckendorf and Negative Indexed Bunder
Forms
C. J. Glasby, S. P. Glasby, F. Pleijel, Worms by number, Proc. Roy. Soc. B, Proc.
Biol. Sci. 275 (1647) (2008) 2071-2076.
L. Goldsmith, The Fibonacci Numbers
M. Griffiths, A Restricted Random Walk defined via a Fibonacci Process, Journal of
Integer Sequences, Vol. 14 (2011), #11.5.4.
Guo-Niu Han, Enumeration of Standard Puzzles
Guo-Niu Han, Enumeration of Standard Puzzles [Cached copy]
S. Happersett, Mathematical meditations

A. P. Hillman & G. L. Alexanderson, Algebra Through Problem Solving, Chapter 2 pp.
11-16, The Fibonacci and Lucas Numbers
A. M. Hinz, S. Klavar, U. Milutinovi, C. Petr, The Tower of Hanoi - Myths and
Maths, Birkhuser 2013. See page 12. Book's website
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 9
Tina Hill Janzen, Fibonacci sequence / Golden scale
Q.-H. Hou, Z.-W. Sun and H.-M. Wen, On monotonicity of some combinatorial sequences
arXiv:1208.3903.
James P. Jones, Diophantine representation of the Fibonacci numbers, Fibonacci
Quarterly 13:1 (1975), pp. 84-88.
R. Jovonovic, Fibonacci Function Calculator
R. Jovonovic, The relations between the Fibonacci and the Lucas numbers
R. Jovanovic, First 70 Fibonacci numbers
S. Kak, The Golden Mean and the Physics of Aesthetics, arXiv:physics/0411195
Louis H. Kauffman and Pedro Lopes, Graded forests and rational knots, arXiv:0710.3765
Blair Kelly, Fibonacci and Lucas factorizations
Tanya Khovanova, Recursive Sequences
C. Kimberling, Matrix Transformations of Integer Sequences, J. Integer Seqs., Vol. 6,
2003.
R. Knott, Fibonacci numbers and the golden section
R. Knott, Mathematics of the Fibonacci Series
R. Knott, Fibonacci numbers with tables of F(0)-F(500).
A. Krowne, PlanetMath.org, Fibonacci sequence
Hendrik Lenstra, Profinite Fibonacci Numbers
M. A. Lerma, Recurrence Relations
D. Litchfield, D. Goldenheim and C. H. Dietrich, Euclid, Fibonacci and Sketchpad
Math. Teacher, 90 (1997).
B. Malesevic, Some combinatorial aspects of differential operation composition on the

space R^n .
Charles P. McKeague, Fibonacci numbers from MathTV
Graeme McRae, Sum of 2m consecutive Fibonacci numbers
D. Merlini, R. Sprugnoli and M. C. Verri, Strip tiling and regular grammars, Theoret.
Computer Sci. 242, 1-2 (2000) 109-124.
D. Merrill, The Fib-Phi Link Page
Jean-Christophe Michel, Le nombre d'or dans l'ensemble de Mandelbrot (in French, 'The
golden number in the Mandelbrot set')
Kerry Mitchell, Spirolateral-Type Images from Integer Sequences, 2013
H. Mishima, Factorizations of Fibonacci
numbers n=1..100, n=101..200, n=201..300,n=301..400, n=401..480
P. Moree, Convoluted convolved Fibonacci numbers
Newton's Institute, Posters in the London Underground
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step
Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
J. Patterson, The Fibonacci Sequence.
T. K. Petersen and B. E. Tenner, The depth of a permutation, arXiv:1202.4765v1
[math.CO].
Ivars Peterson, Fibonacci's Missing Flowers.
Akos Pinter and Volker Ziegler, On Arithmetic Progressions in Recurrences - A new
characterization of the Fibonacci sequence, arXiv:1005.3624
Simon Plouffe, Project Gutenberg, The First 1001 Fibonacci Numbers
S. Rabinowitz, Algorithmic Manipulation of Fibonacci Identities (1996).
Arulalan Rajan, R. Vittal Rao, Ashok Rao and H. S. Jamadagni, Fibonacci Sequence,
Recurrence Relations, Discrete Probability Distributions and Linear Convolution
Arxiv preprint arXiv:1205.5398, 2012. - From N. J. A. Sloane, Oct 23 2012
Marc Renault, Properties of the Fibonacci sequence under various moduli, MSc Thesis,
Wake Forest U, 1996.
N. Renton, The fibonacci Series
B. Rittaud, On the Average Growth of Random Fibonacci Sequences, Journal of Integer
Sequences, 10 (2007), Article 07.2.4.

Rosetta Code, A collection of codes to compute fibonacci numbers with different
computer languages
E. S. Rowland, Fibonacci Sequence Calculator up to n=1474
Shiva Samieinia, Digital straight line segments and curves. Licentiate Thesis.
Stockholm University, Department of Mathematics, Report 2007:6.
D. Schweizer, First 500 Fibonacci Numbers in blocks of 100.
Mark A. Shattuck and Carl G. Wagner, Periodicity and Parity Theorems for a Statistic
on r-Mino Arrangements, Journal of Integer Sequences, Vol. 9 (2006), Article
06.3.6.
S. Silvia, Fibonacci sequence
Jaap Spies, Sage program for computing A000045
Michael Z. Spivey and Laura L. Steil, The k-Binomial Transforms and the Hankel
Transform, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.1.
Z.-H. Sun, Congruences For Fibonacci Numbers
Roberto Tauraso, A New Domino Tiling Sequence, Journal of Integer Sequences, Vol. 7
(2004), Article 04.2.3.
Thesaurus.Maths.org, Fibonacci sequence
K. Tognetti, Fibonacci-His Rabbits and His Numbers and Kepler
C. Vila, Nature by numbers (animation).
Christobal Vila, Nature Numbers (Video related to Fibonacci numbers)
N. N. Vorob'ev, Fibonacci numbers, Springer's Encyclopaedia of Mathematics.
Carl G. Wagner, Partition Statistics and q-Bell Numbers (q = -1), J. Integer Seqs.,
Vol. 7, 2004.
Robert Walker, Inharmonic "Golden Rhythmicon" - Fibonacci Sequence in Pairs
Approaching Golden Ratio - With Bounce
Eric Weisstein's World of Mathematics, Fibonacci Number, Double-Free Set, Fibonacci
n-Step Number, Resistor Network
Wikipedia, Fibonacci number
Willem's Fibonacci site, Fibonacci

Roman Witula, Damian Slota and Edyta Hetmaniok, Bridges between different known
integer sequences, Annales Mathematicae et Informaticae, 41 (2013) pp. 255-263.
Aimei Yu and Xuezheng Lv, The Merrifield-Simmons indices and Hosoya indices of trees
with k pendant vertices, J. Math. Chem., Vol. 41 (2007), pp. 33-43. See page 35.
Tianping Zhang and Yuankui Ma, On Generalized Fibonacci Polynomials and Bernoulli
Numbers, Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.3.
Index entries for "core" sequences
Index to divisibility sequences
Index entries for related partition-counting sequences
Index to sequences with linear recurrences with constant coefficients, signature
(1,1).
Index entries for two-way infinite sequences
G.f.: x / (1 - x - x^2).
G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (k + x)/(1 + k*x). - Paul D. Hanna, Oct 26
F(n) = ((1+sqrt(5))^n-(1-sqrt(5))^n)/(2^n*sqrt(5)).
Alternatively, F(n) = ((1/2+sqrt(5)/2)^n-(1/2-sqrt(5)/2)^n)/sqrt(5).
F(n) = F(n-1) + F(n-2) = -(-1)^n F(-n).
F(n) = round(phi^n/sqrt(5)).
F(n+1) = Sum(0 <= j <= [n/2]; binomial(n-j, j)).
This is a divisibility sequence; that is, if n divides m, then a(n) divides a(m).
Michael Somos, Apr 07 2012
E.g.f.: (2/sqrt(5))*exp(x/2)*sinh(sqrt(5)*x/2). - Len Smiley
(smiley(AT)math.uaa.alaska.edu), Nov 30 2001
[0 1; 1 1]^n [0 1] = [F(n); F(n+1)]
x | F(n) ==> x | F(kn).
A sufficient condition for F(m) to be divisible by a prime p is (p - 1) divides m, if
p == 1 or 4 (mod 5); (p + 1) divides m, if p == 2 or 3 (mod 5); or 5 divides m, if
p = 5. (This is essentially Theorem 180 in Hardy and Wright.) - Fred W. Helenius

(fredh(AT)ix.netcom.com), Jun 29 2001
a(n)=F(n) has the property: F(n)*F(m) + F(n+1)*F(m+1) = F(n+m+1). - Miklos Kristof
Nov 13 2003
Kurmang. Aziz. Rashid, Feb 21 2004, makes 4 conjectures and gives 3 theorems:
Conjecture 1: for n>=2 sqrt{F(2n+1)+F(2n+2)+F(2n+3)+F(2n+4)+2*(-1)^n}={F(2n+1)+2*(1)^n}/F(n-1).
Conjecture 2: for n>=0, {F(n+2)* F(n+3)}-{F(n+1)* F(n+4)}+ (-1)^n = 0.
Conjecture 3: for n>=0, F(2n+1)^3 - F(2n+1)*[(2*A^2) -1] - [A + A^3]=0, where A =
{F(2n+1)+sqrt{5*F(2n+1)^2 +4}}/2.
Conjecture 4: for x>=5, if x is a Fibonacci number >= 5 then g*x*[{x+sqrt{5*(x^2) +4}}/2]*[2x+{{x+sqrt{5*(x^2) +- 4}}/2}]*[2x+{{3x+3*sqrt {5*(x^2) +- 4}}/2}]^2+[2x+
{{x+sqrt{5*(x^2) +- 4}}/2}] +- x*[2x+{{3x+3*sqrt{5*(x^2) +- 4}}/2}]^2 -x*[2x+
{{x+sqrt{5*(x^2) +- 4}}/2}]*[x+{{x+sqrt{5*(x^2) +- 4}}/2}]* [2x+
{{3x+3*sqrt{5*(x^2) +- 4}}/2}]^2= 0, where g = {1 + sqrt 5 /2}.
Theorem 1: for n>=0, {F(n+3)^ 2 - F(n+1)^ 2}/F(n+2)={F(n+3)+ F(n+1)}.
Theorem 2: for n>=0, F(n+10) = 11* F(n+5) + F(n).
Theorem 3: for n>=6, F(n) = 4* F(n-3) + F(n-6).
Conjecture 2 of Rashid is actually a special case of the general law F(n)*F(m) +
F(n+1)*F(m+1) = F(n+m+1) (take n <- n+1 and m <- -(n+4) in this law). - Harmel
Nestra (harmel.nestra(AT)ut.ee), Apr 22 2005
Conjecture 2 of Rashid Kurmang simplified: F(n)*F(n+3) = F(n+1)*F(n+2)-(-1)^n.
Follows from d'Ocagne's identity: m=n+2. - Alex Ratushnyak, May 06 2012
Conjecture: for all c such that 2-Phi <= c < 2*(2-Phi) we have F(n) = floor(Phi*a(n1)+c) for n > 2. - Gerald McGarvey, Jul 21 2004
|2*Fib(n) - 9*Fib(n+1)| = 4*A000032(n) + A000032(n+1). - Creighton Dement, Aug 13
For x > Phi, Sum n=0..inf F(n)/x^n = x/(x^2 - x - 1) - Gerald McGarvey, Oct 27 2004
F(n+1) = exponent of the n-th term in the series f(x, 1) determined by the equation
f(x, y) = xy + f(xy, x). - Jonathan Sondow, Dec 19 2004
a(n-1)=sum(k=0, n, (-1)^k*binomial(n-ceil(k/2), floor(k/2))). - Benoit Cloitre, May
05 2005
F(n+1)=sum{k=0..n, binomial((n+k)/2, (n-k)/2)(1+(-1)^(n-k))/2}. - Paul Barry, Aug 28
Fibonacci(n)=Product(1 + 4[cos(j*Pi/n)]^2, j=1..ceil(n/2)-1). [Bicknell and Hoggatt,

pp. 47-48.] - Emeric Deutsch, Oct 15 2006
F(n)=2^-(n-1)*sum{k=0..floor((n-1)/2), binomial(n,2*k+1)*5^k}. - Hieronymus Fischer
Feb 07 2006
a(n)=(b(n+1)+b(n-1))/n where {b(n)} is the sequence A001629. - Sergio Falcon, Nov 22
F(n*m) = Sum{k = 0..m, binomial(m,k)*F(n-1)^k*F(n)^(m-k)*F(m-k)}. The generating

function of F(n*m) (n fixed, m = 0,1,2...) is G(x) = F(n)*x / ((1-F (n-1)*x)^2F(n)*x*(1-F(n-1)*x)-( F(n)*x)^2). E.g., F(15) = 610 = F(5*3) = binomial(3,0)*
F(4)^0*F(5)^3*F(3) + binomial(3,1)* F(4)^1*F(5)^2*F(2) + binomial(3,2)*
F(4)^2*F(5)^1*F(1) + binomial(3,3)* F(4)^3*F(5)^0*F(0) = 1*1*125*2 + 3*3*25*1 +
3*9*5*1 + 1*27*1*0 = 250 + 225 + 135 + 0 = 610. - Miklos Kristof, Feb 12 2007
Miklos Kristof, Mar 19 2007: (Start)
Let L(n)=A000032=Lucas numbers. Then:
For a>=b and odd b, F(a+b)+F(a-b)=L(a)*F(b).
For a>=b and even b, F(a+b)+F(a-b)=F(a)*L(b).
For a>=b and odd b, F(a+b)-F(a-b)=F(a)*L(b).
For a>=b and even b, F(a+b)-F(a-b)=L(a)*F(b).
F(n+m)+(-1)^m*F(n-m)=F(n)*L(m);
F(n+m)-(-1)^m*F(n-m)=L(n)*F(m);
F(n+m+k)+(-1)^k*F(n+m-k)+(-1)^m*(F(n-m+k)+(-1)^k*F(n-m-k))=F(n)*L(m)*L(k);
F(n+m+k)-(-1)^k*F(n+m-k)+(-1)^m*(F(n-m+k)-(-1)^k*F(n-m-k))=L(n)*L(m)*F(k);
F(n+m+k)+(-1)^k*F(n+m-k)-(-1)^m*(F(n-m+k)+(-1)^k*F(n-m-k))=L(n)*F(m)*L(k);
F(n+m+k)-(-1)^k*F(n+m-k)-(-1)^m*(F(n-m+k)-(-1)^k*F(n-m-k))=5*F(n)*F(m)*F(k). (End)
A corollary to Kristof 2007 is 2*F(a+b)=F(a)*L(b)+L(a)*F(b) - Graeme McRae, Apr 24
For n>m, the sum of the 2m consecutive Fibonacci numbers F(n-m-1) thru F(n+m-2) is
F(n)*L(m) if m is odd, and L(n)*F(m) if m is even (see the McRae link). - Graeme
McRae, Apr 24 2014.
Fib(n)=b(n)+(p-1)*sum{1<k<n, floor(b(k)/p)*Fib(n-k+1)} where b(k) is the digital sum
analogue of the Fibonacci recurrence, defined by b(k)=ds_p(b(k-1))+ds_p(b(k-2)),
b(0)=0, b(1)=1, ds_p=digital sum base p. Example for base p=10: Fib(n)=A010077
+9*sum{1<k<n, A059995(A010077(k))*Fib(n-k+1)}. - Hieronymus Fischer, Jul 01 2007
Fib(n)=b(n)+p*sum{1<k<n, floor(b(k)/p)*Fib(n-k+1)} where b(k) is the digital product
analogue of the Fibonacci recurrence, defined by b(k)=dp_p(b(k-1))+dp_p(b(k-2)),
b(0)=0, b(1)=1, dp_p=digital product base p. Example for base p=10:
Fib(n)=A074867(n)+10*sum{1<k<n, A059995(A074867(k))*Fib(n-k+1)}. -Hieronymus
Fischer, Jul 01 2007
a(n) = denominator of continued fraction [1,1,1,...] (with n ones); e.g., 2/3 =
continued fraction [1,1,1]; where barover[1] = [1,1,1...] = .6180339.... - Gary W.
Adamson, Nov 29 2007
F(n + 3) = 2F(n + 2) - F(n), F(n + 4) = 3F(n + 2) - F(n), F(n + 8) = 7F(n + 4) F(n), F(n + 12) = 18F(n + 6) - F(n). - Paul Curtz, Feb 01 2008
1 = 1/(1*2) + 1/(1*3) + 1/(2*5) + 1/(3*8) + 1/(5*13) + ... = 1/2 + 1/3 + 1/10 + 1/24
+ 1/65 + 1/168 + ...; where A059929 = (0, 2, 3, 10, 24, 65, 168,...). - Gary W.
Adamson, Mar 16 2008
a(2^n) = prod{i=0}^{n-2}B(i) where B(i) is A001566. Example 3*7*47 = Fib(16).
Kenneth J Ramsey, Apr 23 2008
F(n) = (1/(n-1)!) * [ n^(n-1) - { C(n-2,0) +4*C(n-2,1) +3*C(n-2,2) }*n^(n-2) +
{ 10*C(n-3,0) +49*C(n-3,1) +95*C(n-3,2) +83*C(n-3,3) +27*C(n-3,4) }*n^(n-3) { 90*C(n-4,0) +740*C(n-4,1) +2415*C(n-4,2) +4110*C(n-4,3) +3890*C(n-4,4) +1950*C(n4,5) +405*C(n-4,6) }*n^(n-4) + ... ]. - Andr F. Labossire, Nov 24 2004
a(n+1)=Sum_{k, 0<=k<=n} A109466(n,k)*(-1)^(n-k). [Philippe Delham, Oct 26 2008]
Formula from Thomas Wieder, Feb 25 2009:
a(n) = sum_{l_1=0}^{n+1} sum_{l_2=0}^{n}...sum_{l_i=0}^{n-i}...sum_{l_n=0}^{1}
delta(l_1,l_2,...,l_i,...,l_n)
where delta(l_1,l_2,...,l_i,...,l_n) = 0 if any l_i + l_(i+1) >= 2 for i=1..n-1
and delta(l_1,l_2,...,l_i,...,l_n) = 1 otherwise.
2^n (\prod _{k=1}^n \sqrt[4]{\cos^2(k\pi/(n+1))+1/4})^2 (Kasteleyn's formula
specialized). - Sarah-Marie Belcastro (smbelcas(AT)toroidalsnark.net), Jul 04 2009
a(n+1) =sum_{k=floor[n/2] mod 5} C(n,k) - sum_{k=floor[(n+5)/2] mod 5} C(n,k)
A173125(n)-A173126(n) =|A054877(n)-A052964(n-1)|. - Henry Bottomley, Feb 10 2010
If p[i]=modp(i,2) and if A is Hessenberg matrix of order n defined by: A[i,j]=p[ji+1], (i<=j), A[i,j]=-1, (i=j+1), and A[i,j]=0 otherwise. Then, for n>=1, a(n)=det
Milan Janjic, May 02 2010
Limit(F(k+n)/F(k), k = infinity) = (L(n) + F(n)*sqrt(5))/2 with the Lucas numbers
L(n)= A000032(n). - Johannes W. Meijer, May 27 2010

For n>=1, F(n)=round(log_2(2^{\phi*F(n-1)}+2^{\phi*F(n-2)})), where \phi is Golden
ratio. - Vladimir Shevelev, Jun 24 2010, Jun 27 2010
For n>=1, a(n+1)=ceil(phi*a(n)), if n is even and a(n+1)=floor(phi*a(n)), if n is odd
(phi=golden ratio). - Vladimir Shevelev, Jul 01 2010
a(n)=2*a(n-2)+a(n-3), n>2. - Gary Detlefs, Sep 08 2010
a(2^n)=Prod{i=0,...,n-1} A000032(2^i). - Vladimir Shevelev, Nov 28 2010
a(n)^2 - a(n-1)^2 = a(n+1)*a(n-2), see A121646.
a(n) = sqrt((-1)^k*(a(n+k)^2-a(k)*a(2n+k))), for any k. - Gary Detlefs, Dec 03 2010
F(2*n) = F(n+2)^2 - F(n+1)^2 - 2*F(n)^2. - Richard R. Forberg, Jun 04 2011
Artur Jasinski, Nov 17 2011: (Start)
(-1)^(n+1) = F(n)^2 + F(n)*F(1+n) - F(1+n)^2.
F(n) = -F(n+2)(-2+(F(n+1))^4 + 2*(F(n+1)^3*F(n+2)) - (F(n+1)*F(n+2))^2 2*F(n+1)
(F(n+2))^3 + (F(n+2))^4)-F(n+1). (End)
F(n) = 1 + sum_{x=1..n-2} F(x). - Joseph P. Shoulak, Feb 05 2012
F(n) = 4*F(n-2) - 2*F(n-3) - F(n-6). - Gary Detlefs, Apr 01 2012
F(n) = round(phi^(n+1)/(phi+2)). - Thomas Ordowski, Apr 20 2012
Sergei N. Gladkovskii, Jun 03 2012: (Start)
G.f. A(x) = x/(1-x-x^2) = G(0)/sqrt(5) where G(k)= 1 -((-1)^k)*2^k/(a^k b*x*a^k*2^k/(b*x*2^k - 2*((-1)^k)*c^k/G(k+1))) and a=3+sqrt(5), b=1+sqrt(5), c=3sqrt(5); (continued fraction, 3rd kind, 3-step).
Let E(x) be the e.g.f., i.e.,
E(x) = 1*x+1/2*x^2+1/3*x^3+1/8*x^4+1/24*x^5+1/90*x^6+13/5040*x^7+... then
E(x) = G(0)/sqrt(5); G(k)= 1 -((-1)^k)*2^k/(a^k - b*x*a^k*2^k/(b*x*2^k - 2*((1)^k)*(k+1)*c^k/G(k+1))), where a=3+sqrt(5), b=1+sqrt(5), c=3-sqrt(5); (continued
fraction, 3rd kind, 3-step).
Hieronymus Fischer, Nov 30 2012: (Start)

Fib(n) = 1 + sum_{j_1=1..n-2} 1 + sum_{j_1=1..n-2} sum_{j_2=1..j_1-2} 1 +
sum_{j_1=1..n-2} sum_{j_2=1..j_1-2} sum_{j_3=1..j_2-2} 1 + ... + sum_{j_1=1..n-2}

sum_{j_2=1..j_1-2} sum_{j_3=1..j_2-2} ... sum_{j_k=1..j_(k-1)-2} 1, where k =
floor((n-1)/2).
Example: Fib(6) = 1 + sum_{j=1..4} 1 + sum_{j=1..4} sum_{k=1..(j-2)} 1 + 0 = 1 + (1 +
1 + 1 + 1) + (1 + (1 + 1)) = 8.
Fib(n) = sum_{j=0..k} S(j+1,n-2j), where k = floor((n-1)/2) and the S(j,n) are the nth j-simplex sums: S(1,n) = 1 is the 1-simplex sum, S(2,n) = sum_{k=1..n} S(1,k) =
1+1+...+1 = n is the 2-simplex sum, S(3,n) = sum_{k=1..n} S(2,k) = 1+2+3++n is the
3-simplex sum (= triangular numbers = A000217), S(4,n) = sum_{k=1..n} S(3,k) =
1+3+6+...+n(n+1)/2 is the 4-simplex sum (= tetrahedral numbers = A000292) and so
Since S(j,n) = binomial(n-2+j,j-1), the formula above equals the well-known binomial
formula, essentially.
G.f. A(x) = x / (1 - x / (1 - x / (1 + x))). - Michael Somos, Jan 04 2013

sum{n>=1}(-1)^(n-1)/(a(n)*a(n+1)) = 1/phi (phi=golden ratio). - Vladimir Shevelev
Feb 22 2013
Vladimir Shevelev, Feb 24 2013: (Start)
(1) Expression a(n+1) via a(n): a(n+1) = (a(n) + sqrt(5*(a(n))^2 + 4*(-1)^n))/2;
(2) sum_{k=1,...,n} (-1)^(k-1)/(a(k)*a(k+1)) = a(n)/a(n+1);
(3) a(n)/a(n+1) = 1/phi + r(n), where |r(n)| < 1/(a(n+1)*a(n+2)). (End)
F(n+1) = F(n)/2 + sqrt((-1)^n + 5*F(n)^2/4), n>=0. F(n+1) = U_n(i/2)/i^n, (U:=
Chebyshef 2nd kind). - R. W. Gosper, Mar 04 2013
G.f.: -Q(0) where Q(k) = 1 - (1+x)/(1 - x/(x - 1/Q(k+1) )); (continued fraction).
Sergei N. Gladkovskii, Mar 06 2013
G.f.: x-1-1/x + 1/x/Q(0), where Q(k) = 1 - (k+1)*x/(1 - x/(x - (k+1)/Q(k+1)));
(continued fraction). - Sergei N. Gladkovskii, Apr 23 2013
G.f.: x*G(0), where G(k)= 1 + x*(1+x)/(1 - x*(1+x)/(x*(1+x) + 1/G(k+1) )); (continued
fraction). - Sergei N. Gladkovskii, Jul 08 2013
G.f.: x^2 - 1 + 2*x^2/(W(0)-2), where W(k) = 1 + 1/(1 - x*(k + x)/( x*(k+1 + x) +
1/W(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Aug 28 2013
G.f.: Q(0) -1, where Q(k) = 1 + x^2 + (k+2)*x -x*(k+1 + x)/Q(k+1); (continued
fraction). - Sergei N. Gladkovskii, Oct 06 2013
Let b(n) = b(n-1) + b(n-2), with b(0) = 0, b(1) = phi. Then, for n>=2, F(n)=
floor(b(n-1)) if n is even, F(n) = ceil(b(n-1)), if n is odd, with convergence.

Richard R. Forberg, Jan 19 2014
a(n)= sum(t1*g(1)+t2*g(2)+...+tn*g(n)=n, multinomial(t1+t2 +...+tn,t1,t2,...,tn),
where g(k)=2*k-1. - Mircea Merca, Feb 27 2014
F(n) = round(sqrt(F(n-1)^2 + F(n)^2 + F(n+1)^2)/2), for n > 0. This rule appears to
apply to any sequence of the form a(n) = a(n-1) + a(n-2), for any two values of
a(0) and a(1), if n is sufficiently large. - Richard R. Forberg, Jul 27 2014
F(n) = round(2/(1/F(n) + 1/F(n+1) + 1/F(n+2)), for n > 0. This rule also appears to
apply to any sequence of the form a(n) = a(n-1) + a(n-2), for any two values of
a(0) and a(1), if n is sufficiently large. - Richard R. Forberg, Aug 03 2014
F(n) = round(1/sum(j>=n+2, 1/F(j))). - Richard R. Forberg, Aug 14 2014
a(n) = hypergeometric([-n/2+1/2, -n/2+1], [-n+1], -4) for n>=2. - Peter Luschny
19 2014
For x = 0,1,2,3,4, x=1/(x+1) = 1, 1/2, 2/3, 3/5, 5/8. These fractions have numerators
1,1,2,3,5, which are the 2nd to 6th entries in the sequence. - Cino Hilliard, Sep
15 2008
Joerg Arndt, May 21 2013: (Start)
There are a(7)=13 compositions of 7 where there is a drop between every second pair
of parts, starting with the first and second part:
[ 2 1 2 1 1 ]
[ 2 1 3 1 ]
[ 2 1 4 ]
[ 3 1 2 1 ]
[ 3 1 3 ]
[ 3 2 2 ]
[ 4 1 2 ]
[ 4 2 1 ]
[ 4 3 ]
[ 5 1 1 ]
[ 5 2 ]
[ 6 1 ]
[ 7 ]
There are abs(a(6+1))=13 compositions of 6 where there is no rise between every
second pair of parts, starting with the second and third part:
[ 1 2 1 2 ]
[ 1 3 1 1 ]
[ 1 3 2 ]
[ 1 4 1 ]
[ 1 5 ]
[ 2 2 1 1 ]
[ 2 3 1 ]
[ 2 4 ]
[ 3 2 1 ]
[ 3 3 ]
[ 4 2 ]
[ 5 1 ]
[ 6 ]
A000045 := proc(n) combinat[fibonacci](n); end;

ZL:=[S, {a = Atom, b = Atom, S = Prod(X, Sequence(Prod(X, b))), X = Sequence(b, card
>= 1)}, unlabelled]: seq(combstruct[count](ZL, size=n), n=0..38); -Zerinvary Lajos
Apr 04 2008
spec := [ B, {B=Sequence(Set(Z, card>1))}, unlabeled ]: seq(combstruct[count](spec,
size=n), n=1..39); - Zerinvary Lajos, Apr 04 2008
Table[ Fibonacci[ k ], {k, 1, 50} ]
2^(n) Product[((Cos[Pi k/(n + 1)])^2 + (Cos[Pi 1/3])^2)^(1/4), {k, n}]

Product[((Cos[Pi k/(n + 1)])^2 + (Cos[Pi 2/3])^2)^(1/4), {k, n}] (* Kasteleyn's
formula specialized, Sarah-Marie Belcastro (smbelcas(AT)toroidalsnark.net), Jul 04
2009 *)
Table[Fibonacci[n]^5 - Fibonacci[1 + n] + 3 Fibonacci[n]^4 Fibonacci[1 + n] +
Fibonacci[n]^3 Fibonacci[1 + n]^2 - 3 Fibonacci[n]^2 Fibonacci[1 + n]^3
Fibonacci[n] Fibonacci[1 + n]^4 + Fibonacci[1 + n]^5, {n, 1, 10}] (* Artur
Jasinski, Nov 17 2011 *)
LinearRecurrence[{1, 1}, {0, 1}, 40] (* Harvey P. Dale, Aug 03 2014 *)
(Axiom) [fibonacci(n) for n in 0..50]

(MAGMA) [Fibonacci(n): n in [0..38]];
(Maxima) makelist(fib(n), n, 0, 100); /* Martin Ettl, Oct 21 2012 */
(PARI) {a(n) = fibonacci(n)};
(PARI) {a(n) = imag(quadgen(5)^n)};
(PARI) a(n)=my(phi=quadgen(5)); (phi^n-(-1/phi)^n)/(2*phi-1) \\ Charles R Greathouse
, Jun 17 2012
(PARI) {a(n)=polcoeff(sum(m=0, n, x^m*prod(k=1, m, k+x +x*O(x^n))/prod(k=1, m, 1+k*x
+x*O(x^n))), n)} \\ Paul D. Hanna, Oct 26 2013
(Python) # Jaap Spies, Jan 05 2007 (Change leading dots to blanks.)
def fib():
... """ Generates the Fibonacci numbers, starting with 0 """
... x, y = 0, 1
... while 1:
....... yield x
....... x, y = y, x+y
f = fib()
a = [f.next() for i in range(100)]
A000045(n):
... """ Returns Fibonacci number with index n, offset 0, 4 """
... return a[n]
................
A000045_list(N):
... """ Returns a list of the first n Fibonacci numbers """
... return a[:N]
(Sage) ## Demonstration program from Jaap Spies:

a = sloane.A000045; ## choose sequence
print a ## This returns the name of the sequence.
print a(38) ## This returns the 38-th number of the sequence.
print a.list(39) ## This returns a list of the first 39 numbers.
(Haskell)
-- Based on code from http://www.haskell.org/haskellwiki/The_Fibonacci_sequence
-- which also has other versions.
fib :: Int -> Integer
fib n = fibs !! n
.. where
.... fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
{- Example of use: map fib [0..38] Gerald McGarvey, Sep 29 2009 -}
(Sage) [i for i in fibonacci_sequence(0, 40)] # Bruno Berselli, Jun 26 2014
A039834 (signed Fibonacci

numbers), A000213, A000288, A000322, A000383,A060455, A030186, A039834, A020695
20701, A071679, A099731, A100492, A094216,A094638, A000108, A101399, A101400,
A000071, A157725, A001911, A157726,A006327, A157727, A157728, A157729, A167616

A059929, A144152, A152063, A114690,A003893, A000032, A060441, A000930, A003269
First row of arrays A103323, A234357. Second row of arrays A099390, A048887,
A092921 (k-generalized Fibonacci numbers).
A094718(4, n). a(n) = A101220(0, j, n).
A090888(0, k+1) = A118654(0, k+1) = A118654(1, k-1) = A109754(0, k)
A109754(1, k-1), for k > 0.
Fibonacci-Pascal
triangles: A027926, A036355, A037027, A074829, A105809, A109906,A111006, A114197
162741, A228074.
A001690 (complement).
Boustrophedon transforms: A000738, A000744.
Sequence in context: A152163 A039834 * A236191 A020695 A212804 A132916
Adjacent sequences:
A000042 A000043 A000044 * A000046 A000047 A000048
core,nonn,nice,easy,hear
N. J. A. Sloane, Apr 30 1991
approved
Search
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Hints
A026300
Motzkin triangle, T, read by rows; T(0,0) = T(1,0) = T(1,1) = 1; for n >= 2, T(n,0) = 1,
T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k) for k = 1,2,...,n-1 and T(n,n) = T(n-1,n-2) +
T(n-1,n-1).
1, 1, 1, 1, 2, 2, 1, 3, 5, 4, 1, 4, 9, 12, 9, 1, 5, 14, 25, 30, 21, 1, 6, 20, 44, 69,

76, 51, 1, 7, 27, 70, 133, 189, 196, 127, 1, 8, 35, 104, 230, 392, 518, 512, 323, 1, 9,
44, 147, 369, 726, 1140, 1422, 1353, 835, 1, 10, 54, 200, 560, 1242, 2235, 3288, 3915,
3610, 2188 (list; table; graph; refs; listen;history; text; internal format)
OFFSET
0,5
COMMENTS
Right-hand columns have g.f. M^k, where M is g.f. of Motzkin numbers.

Consider a semi-infinite chessboard with squares labeled (n,k), ranks or
rows n >= 0, files or columns k >= 0; number of king-paths of length n
from (0,0) to (n,k), 0 <= k <= n, is T(n,n-k). - Harrie Grondijs, May 27
2005. Cf. A114929, A111808,A114972.
REFERENCES
M. Aigner, Motzkin Numbers, Europ. J. Comb. 19 (1998), 663-675.

F. R. Bernhart, Catalan, Motzkin and Riordan numbers, Discr. Math., 204
(1999) 73-112.
L. Carlitz, Solution of certain recurrences, SIAM J. Appl. Math., 17
(1969), 251-259.
J. L. Chandon, J. LeMaire and J. Pouget, Denombrement des quasi-ordres sur
un ensemble fini, Math. Sci. Humaines, No. 62 (1978), 61-80.
Harrie Grondijs, Neverending Quest of Type C, Volume B - the endgame
study-as-struggle.
A. Luzn, D. Merlini, M. A. Morn, R. Sprugnoli, Complementary Riordan
arrays, Discrete Applied Mathematics, 172 (2014) 75-87.
A. Nkwanta, Lattice paths and RNA secondary structures, in African
Americans in Mathematics, ed. N. Dean, Amer. Math. Soc., 1997, pp. 137147.
LINKS
Reinhard Zumkeller, Rows n = 0..120 of triangle, flattened

J. L. Arregui, Tangent and Bernoulli numbers related to Motzkin and
Catalan numbers by means of numerical triangles.
H. Bottomley, Illustration of initial terms
3
9
M. Buckley, R. Garner, S. Lack, R. Street, Skew-monoidal categories and

the Catalan simplicial set, arXiv preprint arXiv:1307.0265, 2013
A. Roshan, P. H. Jones and C. D. Greenman, An Exact, Time-Independent
Approach to Clone Size Distributions in Normal and Mutated Cells, arXiv
preprint arXiv:1311.5769, 2013
Mark C. Wilson, Diagonal asymptotics for products of combinatorial
classes, PDF.
FORMULA
T(n, k)=Sum(i=0, Floor(k/2), binomial(n, 2i+n-k)[binomial(2i+n-k, i)binomial(2i+n-k, i-1)]) - Herbert Kociemba, May 27 2004
T(n, k) = A027907(n, k) - A027907(n, k-2), k<=n.
Sum_{k, 0<=k<=n}(-1)^k*T(n,k)=A099323(n+1) . - Philippe Delham, Mar 19
2007
Sum(T(n,k) mod 2, 0<=k<=n) = A097357(n+1) . - Philippe Delham, Apr 28
2007
Sum_{k, 0<=k<=n} T(n,k)*x^(nk)= A005043(n), A001006(n), A005773(n+1), A059738(n) for x = -1, 0, 1, 2
respectively. [From Philippe Delham, Nov 28 2009]
EXAMPLE
1;
1,1;
1,2,2;
1,3,5,4;
1,4,9,12,9;
1,5,14,25,30,21;
...
MAPLE
A026300 := proc(n, k)
add(binomial(n, 2*i+n-k)*(binomial(2*i+n-k, i) -binomial(2*i+n-k, i1)) , i=0..floor(k/2)) ;
end proc: # R. J. Mathar, Jun 30 2013
MATHEMATICA
t[n_, k_] := Sum[ Binomial[n, 2i + n - k] (Binomial[2i + n - k, i] Binomial[2i + n - k, i - 1]), {i, 0, Floor[k/2]}]; Table[ t[n, k], {n,
0, 10}, {k, 0, n}] // Flatten (* Robert G. Wilson v, Jan 03 2011 *)
t[_, 0] = 1; t[n_, 1] := n; t[n_, k_] /; k>n || k<0 = 0; t[n_, n_] := t[n,
n] = t[n-1, n-2]+t[n-1, n-1]; t[n_, k_] := t[n, k] = t[n-1, k-2]+t[n-1,
k-1]+t[n-1, k]; Table[t[n, k], {n, 0, 10}, {k, 0, n}] // Flatten
(* Jean-Franois Alcover, Apr 18 2014 *)
PROG
(Haskell)
a026300 n k = a026300_tabl !! n !! k
a026300_row n = a026300_tabl !! n
a026300_tabl = iterate (\row -> zipWith (+) ([0, 0] ++ row) $
zipWith (+) ([0] ++ row) (row ++ [0])) [1]
-- Reinhard Zumkeller, Oct 09 2013
CROSSREFS
Motzkin numbers (A001006) are T(n, n), other columns of T

include A002026, A005322,A005323.
Cf. A020474.
Row sums are in A005773.
Reflected version is in A064189. Cf. A059738.
Sequence in context: A079956 A140717 A160232 * A099514 A228352 A205575
Adjacent sequences:
A026297 A026298 A026299 * A026301 A026302 A026303
KEYWORD
nonn,tabl,nice
AUTHOR
Clark Kimberling
EXTENSIONS
Corrected and edited by Johannes W. Meijer, Oct 05 2010

STATUS
approved
The ISOLATOR (REVISED)
Endbox has to be thanked and take alot of credit, for the new revised version of
the ISOLATOR. I wasn't quite happy with the original concept. It appeared to be
an attractive option. Betting on one number at a time. But the consistency has
proved negative. With as many as 19 losing bets in a row.
Now for some time I have been wondering if the Eliminator could be improved. If
I could find something that had a similar or better strike rate. And a better
monthly turnover.
I have FOUND IT. Thanks to something Endbox mentioned a while back about the
first line in the ISOLATOR virtually always getting down to the last number in 6--8 draws. I decided to see how this would work using the Eliminator concept of
betting on the final 2 numbers for a maximum of 4 bets.
The results for 2006 from 45 completed ISOLATORS. Are very impressive. Lets
just say the Eliminator has been dethroned. I will be posting those 45 results and
the new rules for the ISOLATOR over the next few days. Peace.
#2
05-18-2006, 06:35 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
The One!
Okay this is the revised ISOLATOR that I have been speaking about. I enjoyed my
first official win today when number 24 split (24)(26) in the 5th draw to become
the 40th winner of 2006. Below is what a numbers grid for the ISOLATOR looks
like.
01,02,03,04,05,06,07,
11,12,13,14,15,16,17,
21,22,23,24,25,26,27,
31,32,33,34,35,36,37,
41,42,43,44,45,46,47,
There are still just 35 numbers in the new ISOLATOR. The basic rules are as
follows.
(01) There are 10 ISOLATORS per month, spaced out 6 draws apart. Always
starting on the 1st of the month and then 6 draws apart. So these would be the
starting points of the 10 ISOLATORS for May.
(01)
(02)
(03)
(04)
(05)
(06)
(07)
(08)
(09)
(10)
The
The
The
The
The
The
The
The
The
The
1st
4th
7th
10th
13th
16th
19th
22nd
25th
28th
When the first line gets down to the last 2 numbers. It has qualified for that
particular ISOLATOR. And all the other lines are excluded. You then proceed to
bet on those two numbers for a maximum of 4 bets. In the same way you would
for the Eliminator.
If 2 or more lines qualify simultaneously. You favour line 31-37 if it is among
them. Or line 21-27. If the 30s are not there. Or thirdly 41-47. The reason being
these lines have a better success rate Over the others.
If the first line is a void by 2 of the last 3 numbers being drawn together. You wait
for the second line to qualify and go with that one instead. The biggest difference
between the Isolator and the Eliminator apart from there being 4 more a month.
Is you have to wait far less time to get the win or loss. For example a typical
Eliminator takes 18--22 draws to complete. An Isolator can be over as quickly as
*3* draws. And that is the major improvement. Most wins or losses are achieved
in 2-4 days instead of 9-12. And that keeps the interest and turnover coming
faster.
So those are the basics, if anyone wants to know anymore. Feel free to ask me.
This isn't replacing the Eliminator, Simply working alongside it. Together we now
have a fantastic monthly turnover of a potential 16 wins. But a realistic 12 or 13
instead of the 4 or 5 the Eliminator alone would give us. Some nice winning
streaks are possible. There has been 10 in a row already this year. And after
todays win we now have a streak of 9 in a row. So below are the years results so
far. Peace..
(THE ISOLATOR 2006 RESULTS)
---JANUARY--NO.01 WON IN DRAW 5-(21)-BET/1
NO.02 LOST
NO.03 WON IN DRAW 7-(33)-BET/1
NO.06 LOST
---FEBRUARY--NO.11 WON IN DRAW 8-(44)-BET/3
NO.15 LOST
---MARCH--NO.21 WON IN DRAW 8-(31)-BET/3
NO.25 WON IN DRAW11'(23)-BET/4
NO.26 LOST
NO.28 LOST
---APRIL--NO.31 WON IN DRAW 5-(21)-BET/2
NO.32 WON IN DRAW11'(31)-BET/4
NO.37 LOST
---MAY--NO.41 WON IN DRAW 6-(26)-BET/3
WINS 40 (25 IN 2 BETS OR LESS)

LOSSES 06
OVERALL S/R 6.5--1
#3
05-19-2006, 03:07 AM
taaroa
Registered User
Join Date: Apr 2005

Location: Tahiti
Posts: 267
Thanks fullhouse for sharing this new finding. Thanks also to Enbox for inspiring
this new isolator. A new tool to hit the jackpot!
Take care,
taaroa
#4
05-19-2006, 05:17 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
Quote:
Originally Posted by taaroa

Thanks fullhouse for sharing this new finding. Thanks also to Enbox for inspiring
this new isolator. A new tool to hit the jackpot!
Take care,
taaroa
Hi Taaroa,
Yes it is a solid strategy. Not a jackpot winner. But it will increase your bankroll
over the course of a year considerably. As long as you're are faithful to the rules.
And don't try to grow too fast. Peace...
#5
05-20-2006, 11:59 AM
endbox
Registered User
Join Date: May 2004

Posts: 203
Hi all
On holls in fuerteventura at the moment , writing this from a cyber

cafe !.......Love this site.....Things can only get stronger if we continue to share
thoughts & opinions......Take care endbox
#6
05-20-2006, 07:10 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
Quote:
Originally Posted by endbox

On holls in fuerteventura at the moment , writing this from a cyber
cafe !.......Love this site.....Things can only get stronger if we continue to share
thoughts & opinions......Take care endbox
Hey Endbox hope you are having a great time??

Yes indeed. Were it not for you this improved ISOLATOR would never have come
about. I wouldn't have seen it on my own. So I am thankful to get feedback from
you and others. It can only take us forward. Peace...
#7
05-21-2006, 02:27 PM
Springbok
Registered User
Join Date: May 2004

Location: Durban,KwaZulu-Natal South Africa/London UK
Posts: 859
Hi Fullhouse, Endbox
You really are observant. I came across this situation with the 2 numbers on one
line but ignored it as I was searching for the one number in the isolator. At this
stage I have not tested the previous isolator technique further because of a lack
of time but will be spending some time on it as I will be working a normal working
hours for the next 8 days. Let's talk about staking on your new strategy, taking
into account you have to bet on 2 numbers. Obviously you have to use
progressive staking up to 4 bets and make a profit that takes into account
previous losses.
#8
05-21-2006, 08:09 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
Quote:
Originally Posted by Springbok

You really are observant. I came across this situation with the 2 numbers on
one line but ignored it as I was searching for the one number in the isolator. At
this stage I have not tested the previous isolator technique further because of a
lack of time but will be spending some time on it as I will be working a normal
working hours for the next 8 days. Let's talk about staking on your new
strategy, taking into account you have to bet on 2 numbers. Obviously you
have to use progressive staking up to 4 bets and make a profit that takes into
account previous losses.
HEY SPRINGBOK!
Nice to hear from you again. It gets kind of lonely on here, Lol! Yes if there is one
thing you will learn about me it is I consider good money management the most
important aspect of any strategy. The discipline to hold back when you should and
throw down when its due. With the ISOLATOR. I don't believe in a rigid
mechanical style of staking. So for example I would never just bet 1pt bet one,
2pts bet 2 and so on.
I would take each ISOLATOR in relation to what happened in the last one. So if
the previous ISOLATOR had been a losing one. In the following one I would
double stakes or even treble them. Also I watch for how many times and
ISOLATOR has or hasn't won in the first 2 bets. Because these are the bets that
can make profit at level stakes. Bet 3 would break even at level staking and bet 4
would give you a 33% loss at level stakes. So my goal is to utilize the wins in the
first 2 bets to the MAX. So if the last 2 or 3 Isolators won in bet 3 or 4. I would
again increase my stakes for bets one and two in the following ISOLATORS.
Another method I use in the Eliminator. Is to automatically drop down to half
stakes after **3** consecutive wins. The thinking here is a loss is inevitable.
Although long streaks are possible. The average is 4 wins in a row, for the
Eliminator. Lately is has been 5. The Isolator is capable of producing streaks of 8
or more on a regular basis. So I may set the threshold at 6 before reducing to
half stakes. And after a loss I double up again. This method protects your profits.
And then exploits the fact that back to back losers rarely occur. And I have never
seen 3 losers in a row for the Eliminator. I can't speak for the Isolator yet. But
one thing is certain. It at least matches the Eliminators minumum of 3 wins to
every loss. And that is all you need to know.
Today ISOLATOR 47 QUALIFIED. The first line 31--37 was a void when numbers
31/33 were drawn lunchtime leaving just number 36. But number 43 was also
drawn in line 41--47. Leaving numbers (44)(47) which are our qualifiers. I bet
very little on the first bet at Teatime. BECAUSE, the previous ISOLATOR won in
the first bet. Again my staking is ALWAYS in response to what occurs before. And
it has served me well. So from tommorow I will increase my stakes on numbers
(44)(47). I am aware that we are on a serious winning streak now. Presently at 9
in a row. So I expect a loser soon. And this may be it. Peace...
#9
05-23-2006, 12:03 PM
syscrash
Registered User
thanks for the hint to look at 46 and 47...
Join Date: Dec 2005

Location: Canada
Posts: 146
I'm not sure about the revised method... but If I follow your instruction...
tomorrow we should all look at 24 and 25?
#10
05-23-2006, 12:43 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
Quote:
Originally Posted by syscrash

Hi Syscrash.
ISOLATOR 47 ended today with number 47 splitting (44)(47) and giving us our
10th win in a row which is fantastic.
Now you see the beauty of this new ISOLATOR Syscrash. No sooner have we had
our latest winner and ISOLATOR 48 is already qualified with (like you said )
numbers (24)(25) So yes tomorrow we go after that pair. Be careful though. After
10 wins in a row. We must expect a loss now. So don't go crazy.
So here is how the ISOLATOR stands for 2006 now.
WINS 41
LOSSES 6
OVERALL S/R 6.6--1
Exceptional at the moment. I can't believe this can hold for the year. Only time
will tell. Peace...
#11
05-23-2006, 12:43 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
Quote:

Hi Syscrash.
ISOLATOR 47 ended today with number 47 splitting (44)(47) and giving us our
10th win in a row which is fantastic.
Now you see the beauty of this new ISOLATOR Syscrash. No sooner have we had
our latest winner and ISOLATOR 48 is already qualified with (like you said )
numbers (24)(25) So yes tomorrow we go after that pair. Be careful though. After
10 wins in a row. We must expect a loss now. So don't go crazy.
So here is how the ISOLATOR stands for 2006 now.
WINS 41
LOSSES 6
OVERALL S/R 6.6--1
Exceptional at the moment. I can't believe this can hold for the year. Only time
will tell. Peace...
#12
05-24-2006, 08:17 AM
syscrash
Registered User
Join Date: Dec 2005

Location: Canada
Posts: 146
For this tea time,

31 and 36 is qualified... must we lays some minimal stakes on them?
#13
05-24-2006, 12:26 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
11 in a row!
Quote:

For this tea time,
31 and 36 is qualified... must we lays some minimal stakes on them?
Hi Syscrash,
Strictly speaking no. We only want the first available line in each ISOLATOR. So
today at lunchtime number 24 popped. And gave us our 11th win in a row. And
8th in a row for May. Which is above all my expectations. Number 24 has
redeemed itself. As it has now given the ISOLATOR 2 of its last 3 wins. Both in the
first bet. Now the only question is, can this winning streak continue And give us a
perfect month for the first time this year? It is a big ask. It would mean the
winning streak would have to extend to 13 in a row. But It would be a wonderful
start for this fantastic Strategy. Especially as the Eliminator and S-B-S strategies
have under performed in May. So here is how we now stand with the ISOLATOR
after 48 starts.
WINS 42
LOSSES 06
OVERALL S/R 7--1
LONGEST WINNING STREAK 11 IN A ROW (CURRENT)
A strike rate of 7--1 is unheard of. I know this can't maintain. But I will enjoy it
while it does. So now we have a little wait as this ISOLATOR finished fast.
Tomorrow ISOLATOR 49 begins. Lets see if we can go 12 in a row. Peace...
#14
05-24-2006, 05:28 PM
endbox
Registered User
Join Date: May 2004

Posts: 203
Hi all
Back from holl's.........Anyway back to the serious buisiness , this stratergy seems
superb , gone back 100 draws or so & picked random points ......Your're right
Fullhouse it works !........As one ISOLATOR finishes I'm still going to start a fresh ,
ie just wait untill another qualifies , take care endbox
#15
05-24-2006, 05:40 PM
fullhouse
Registered User
Join Date: Jan 2006

Location: london UK
Posts: 362
Quote:
Originally Posted by endbox

Back from holl's.........Anyway back to the serious buisiness , this stratergy
seems superb , gone back 100 draws or so & picked random points ......Your're
right Fullhouse it works !........As one ISOLATOR finishes I'm still going to start
a fresh , ie just wait untill another qualifies , take care endbox
Hi Endbox,
Yes I have only ever seen a winning streak longer than 11 in a row ONCE. And
that was the Eliminator from late OCTOBER 2005 to early JANUARY 2006 when it
went 14 in a row minus the voids in between. This ISOLATOR has already given
us 10 in a row this year. And is now 11 in a row. If the next 2 win that will be a
perfect 10 out of 10 for May. A FULLHOUSE, Lol!
But as I said that is a big ask. To go 13 in a row. Man I will be excited. I like the
increased frequency alot too Endbox. For example yesterday ISOLATOR 47 won
when (44)(47) split with number 47. And today ISOLATOR 48 won with number
24 splitting (24)(25)
That would never happen so fast with the Eliminator. You usually have to wait at
least four to six days between wins and losses. So if the previous Eliminator was a
loss. You have to dwell on it too long. With the ISOLATOR its not going to be too
long before you're back to winning ways. I love it. And you are largely to thank
Endbox.
So work this baby. Your bankroll is going to grow. And at a faster pace. I just
hope you don't start with the expected loss. Lol! Peace...
Number Picker Challenge Selection Methods
Was thinking the number picker challenge is possibly a good opportunity to share
ideas/methods on selecting numbers. I will post my current selection method and
others are free to share theirs (or not). I don't know how LotteryHits selects so
won't be able to provide that. My current method (done by computer):
Randomly select 20 unique numbers. Compare the selected set to the following
criteria and discard if it fails:
No more than 5 matching any of the previous jackpots (I use the full draw
history).
No more than 4 matching any of the last 100 draws.
No more than 3 matching any of the last 3 draws.
No more than 6 matching the last 3 draws combined (so no more than 6 from the
18 numbers in the last 3 draws).
Odd/Even 8-12.
High/Low 8-12.
No more than 6 from same decade.
No more than 3 of the same last digit.
No more than 3 of the same individual number rootsum.
No more than 4 from the same 7 number group (1-7, 8-14 etc.)
No more than 5 consecutives.

Looking forward to see the different selection methods of those willing to share
.
#2
01-28-2014, 07:41 AM
Icewynd
Registered User
Join Date: Aug 2010

Posts: 1,415
Hi Ramijami,
Great idea for a post!
What I do is to list all 49 numbers by their skip. I then eliminate numbers that
have skipped more than 10 games. Then I look at what I can eliminate based on
decades, playslip groups (7's grouped by rows and columns), last digits, expected
repeats, etc. Using these 'clues' I eliminate numbers until I have only 20 left.
Good luck!
#3
01-28-2014, 02:41 PM
jol
Registered User
Join Date: Jul 2013

Location: North East of England
Posts: 79
Other than the first challenge game I use non of the above.
I have used the challenge to try a new idea based on previous line hits/misses.
Numbers are the first 20 with no alteration or filter, if it throws out 1 to 20 then
that is what I would use.
I have been chasing the bubble a bit but from now on I will use the same system
without tinkering.
It will be interesting to see how it does.
All the very best of luck.

Jol
#4
02-09-2014, 01:48 PM
Ramijami
Registered User
Join Date: Sep 2013

Posts: 63
Was thinking of a "starting" point for a strategy. The premise is "What if" we
combine the two sets that consistently matches the most numbers when
combined to create a possible starting or "Master" set. These are the previous
sets (from draw 12) with the matching numbers on the side (not sure if there are
errors):
Random - 1 2 4 6 10 11 12 18 19 20 25 26 31 32 34 36 38 42 44 49 --- 25 36 44
(04)
Frank - 03 05 07 09 10 12 14 16 19 20 21 24 26 30 35 45 46 47 48 49
Ramijami - 1, 2, 5, 6, 8, 9, 17, 19, 22, 24, 25, 28, 30, 38, 39, 40, 42, 44, 45, 47
-- 08 25 39 44
LotteryHits - 04 09 11 12 18 19 23 24 25 27 28 29 30 31 33 35 41 45 46 49 --25 27 (04)
Blitzed - 04 07 08 13 16 18 26 29 30 31 33 34 39 40 41 43 44 46 47 49 --- 08
39 44 (04)
IceWynd - 2 4 8 9 11 12 13 14 15 16 18 19 22 23 24 25 26 37 44 45 --- 8 25 44
(04)
Jol - 1 4 5 9 10 11 14 15 16 18 19 25 28 29 35 37 43 45 47 48 --- 25 (4)
Niteowl - 02 04 07 10 11 15 18 19 24 25 28 29 30 35 36 37 40 41 45 49 --- 25
36 (04)
These are the two sets COMBINED that gave the most numbers for draw twelve:
Random+Ramijami (5+b)
1, 2, 5, 6, 8, 9, 17, 19, 22, 24, 25, 28, 30, 38, 39, 40, 42, 44, 45, 47
4 10 11 12 18 20 26 31 32 34 36 49 (32)
Ramijami+Lottery Hits (5+b)
1, 2, 5, 6, 8, 9, 17, 19, 22, 24, 25, 28, 30, 38, 39, 40, 42, 44, 45, 47
04 11 12 18 23 27 29 31 33 35 41 46 49 (33)
Ramijami+NiteOwl (5+b)
1, 2, 5, 6, 8, 9, 17, 19, 22, 24, 25, 28, 30, 38, 39, 40, 42, 44, 45, 47
04 07 10 11 15 18 29 35 36 37 41 49 (32)
These produced (5+b) in 32/33 numbers. I'm sure there should be some full
Jackpots matches in those draws where there was a 5 number match (haven't
had time to back test other than this draw). Could be a possible strategy to
explore if one can choose which two predicted sets to combine to best effect?????
What do others think?
#5
02-10-2014, 07:11 AM
Icewynd
Registered User
Join Date: Aug 2010

Posts: 1,415
Interesting idea, Ramijami.

Indeed, there has been at least one example of a 6 match when combining sets.
In draw 2 (January 4th), I matched 5 numbers (all main numbers). Jol had the
missing main number (4) and 8 different numbers for a total of 28, Frank had the
missing main number and 10 different numbers for a total of 30 and Random had
the missing main number as well as the bonus number (4 +8) with 13 different
numbers for a total of 33 numbers in all. Playing all 1,107,568 combinations of
those 33 numbers would have been profitable indeed, netting a Jackpot plus 6
5/6+Bonus prizes.
Since Frank and Random have been the best predictors so far, a good rule of
thumb might be to combine your set with either (or both) of those.
Keep us posted if you decide to follow this strategy. I think it has promise to
capture all 6 numbers, but gives a rather large pool to deal with.
Good luck!
#6
02-11-2014, 11:56 AM
jol
Registered User
Join Date: Jul 2013

Location: North East of England
Posts: 79
Ramijami. Icewynd
Agreed thats still a massive set of numbers to cover.
Have you ever tried to hit 6 yourself in less than 33 numbers ? your picks so far
in the challenge suggest that you can probably beat 33.
How about a hit 6 in the lowest set of numbers challenge, you pick any set of
numbers, set then out in the order you want them used then see who gets all 6 in
the lowest number of balls.
Hello Jack, I've never tried converting lotto results into Cartesian coordinates, but
have often thought it would be fun to do so. If it were possible, it would make an
interesting chart. I note you had a response when you posted the same question
in that other forum, but must admit the reply did not make much sense to me,
the example given did not stack up. What is your interest and where did you hear
of this idea?
#3
09-27-2014, 09:52 AM
jack
Registered User
Join Date: Feb 2011

Posts: 472
hello, Frank, the idea is to locate positionally, the number sorteiado

* Within a matrix (rows and arranged pre hills) in sectors
* To see little drawings within a matrix of lottery (any lottery)
In rows and columns, as in a closed electrical circuit, or in fields galois (evariste)
Well, then you could see both the largest and best piramedes of your hand
* Frank, open your left hand, it have two triangles, a bigger and better one
* And a third in the middle, as if he could use it in the lottery? Handle three
tamanahos
* Piramedes of synchronized probabilistically itself
Perhaps the three piramedes both hands can tell us something about
probabilities
The Cartesian plane can unite a row and column, and see intervals
Bringing in line pairs
#4
09-27-2014, 12:07 PM
Frank
Registered User
Join Date: Aug 2009

Location: UK
Posts: 358
Sounds like a figment of someone's imagination to me. Pyramids? From two

dimensions?
Can you explain to me how a lottery result 13, 17, 23, 36, 37,42 can be
represented in two dimensions in the Cartesian plane. Over 1000 other such
results also need to represented simultaneously. Explain how pairs are visible in
the final result.
#5
09-27-2014, 12:58 PM
Join Date: Feb 2011
jack
Registered User
Posts: 472
Hello, frank, and easy example of a 49/6 lottery

Divide into 4 groups
12,12,12,13 groups = 4
Each group represented by a letter, 12 letters are
The 12 letters are equal in 4 group has group has 13
* No problem
* Example = 13,17,23,36,7,42
Represented by 12 letters in four equal groups
* Example seo The number 13 is in the other three groups did not repeat the
If G is 17 IN THE OTHER THREE GROUPS NOT MARK G (same position)
* And so with the other letters, in 85% it does not repeat the same position
#6
09-28-2014, 03:12 AM
Frank
Registered User
Join Date: Aug 2009

Location: UK
Posts: 358
But this has nothing to do with Cartesian coordinates does it? Cartesian
coordinates are two numbers , one in the X direction, one on the Y direction and
where they meet on a chart or a grid is where you plot or reference a point. What
you describe is nothing like that.
#7
09-28-2014, 06:31 AM
jack
Join Date: Feb 2011
Registered User
Posts: 472
Goal is to combine both types, (system) to locate positions of reference (pivot),

where the position based not repeated in four groups, from the center into 4
quadrants
#8
09-28-2014, 06:39 AM
Frank
Registered User
Join Date: Aug 2009

Location: UK
Posts: 358
Well I'm sorry Jack, nothing you are saying make any sense to me, so think its
best we leave it there. I'll devise my own interpretation based on the Cartesian
plane, I think!
#9
09-28-2014, 06:44 AM
jack
Registered User
Join Date: Feb 2011

Posts: 472
Hello, frank, objective view is predisposed draw a matrix (rows and columns)
joining a point, starting from the center. as you would then use the Cartesian? in
excel?
#10
09-28-2014, 06:59 AM
Frank
Registered User
Join Date: Aug 2009

Location: UK
Posts: 358
But you've not explained at all how a lottery result 13,17,23,36,7,42 ends up in a
matrix. Nor how 1000 similar ones end up in the same matrix. If you can't do
that, I give up.
#11
09-28-2014, 10:15 AM
bloubul
Registered User
Join Date: Oct 2004

Location: South Africa
Posts: 869
Hi Jack
Do you mind uploading a spreadsheet explaining / demostrating your statement.
I'm as confused as Frank.
[url]www.MediaFire.com[/url] is a free service, upload and paste the link here.
BlouBul
#12
09-28-2014, 10:19 AM
jack
Registered User
1 2 3 4 5 POSITONS
A 01 02 03 04 05
B 06 07 08 09 10
C 11 12 13 14 15
D 16 17 18 19 20
E 21 22 23 24 25
F 26 27 28 29 30
J 31 32 33 34 35
G 36 37 38 39 40
E 41 42 43 44 45
L 46 47 48 49
Join Date: Feb 2011

Posts: 472
13 =C3
#13
09-28-2014, 10:26 AM
jack
Registered User
Join Date: Feb 2011

Posts: 472
ok boublo=
linkhttp://www.mediafire.com/view/rcgpgcv5pxofhjy/SUMS_CARTESIAN_(1)
(2).xlsm
#14
09-28-2014, 10:28 AM
jack
Registered User
Join Date: Feb 2011

Posts: 472
exemplo da lottery 25/15

Sub Button1_Click()
' get data starting row 10 col a-0 (1-15)/5 whole # is group remainder is position
Dim sm(25)
rw = 10
For x = 10 To 1100: For y = 1 To 15: a = Cells(x, y): g = Int(a / 5): p = a - (g *
5): g = g + 1: If p = 0 Then p = 5: g = g - 1
sm(a) = 1
If g = 1 Then gp = "A" & p
If g = 2 Then gp = "B" & p
If g = 3 Then gp = "C" & p
If g = 4 Then gp = "D" & p
If g = 5 Then gp = "E" & p
Cells(x, y + 16) = gp
Next y:
For q = 1 To 25
If sm(q) = 1 Then Cells(x, q + 32) = 1: sm(q) = 0
Next q
Next x
End Sub
#15
09-28-2014, 10:38 AM
Join Date: Feb 2011
jack
Posts: 472
Registered User
[url]http://ge.tt/9wNjXkz1/v/0?c[/url]
EL METODO DEL ESPEJO EN LA LOTERIA

Moderador: nanny13
Buscar este tema
Buscar
5 mensajes Pgina 1 de 1
EL METODO DEL ESPEJO EN LA LOTERIA

por sofiaandrea el 08 Jul 2014, 22:06
BUENAS NOCHES POR FAVOR QUIEN DE USTEDES ME PODRIA EXPLICAR EL METODO DEL ESPEJO
EN LA LOTERIA, POR EJEMPLO ME DICEN EL 3 SE CONVIERTE EN 8, Y ASI SUCESIVAMENTE, COMO
ASI GRACIAS
sofiaandrea
Mensajes: 337
Registrado: 23 Abr 2014, 12:32
A
r
r
i
b
a
Re: EL METODO DEL ESPEJO EN LA LOTERIA

por investigadorloteril el 08 Jul 2014, 22:44
Saludos Sofia
Es esta tabla de conversin de dgitos
1=6
2=7
3=8
4=9
5=0
Existen muchas pero esa es una de las mas utilizada.
a la orden.
investigadorloteril
Mensajes: 1096
Registrado: 05 Sep 2012, 11:38
Ubicacin: Venezuela-Carabobo.

por Beremiz el 09 Jul 2014, 09:39
Buen dia ... Forista Sofiandrea ... Saludos Cordiales ...

El nombre es solo una referencia .. memotecnica ... ayuda memoria.
A
r
r
i
b
a
La tabla que te da el investigador ... define una relacin de equivalencia entre los dgitos del
0 al 9 ...
Supongase que Ud. vio salir en la loteria al .. 508 (La Causa) .... en chance ... lo mas lgico es
que esta salida ... tenga un efecto posterior en los sorteos subsiguientes ... Muchos estudiosos
estiman que ... haciendo las conversiones de los dgitos usando la tabla ... sera una buena
proyeccin o futura jugada en CHANCE ( La misma lotera donde sali el 508) o en su defecto
en otra de la misma operadora en este caso TACHIRA ... As vemos ... por la construccin de
las respectivas equivalencias posibles ... puedes conseguir las 7 sombras ... clones ...
camuflajes .. como te guste ms llamarlos ...
508 -- 503 -- 558 -- 553 -- 008 -- 003 -- 058 -- 053 .. que son el 503 y sus 7 clones ...
Asi ves que cada triple tiene 7 clones o imagenes segn este "espejo"...
Ahora .. si a ese "Espejo" le llamas conversin ... o un "Lente" especial ... Veras las 7imagenes que el 508 proyecta ...
Los "Espejos" como les conocemos en casa ... solo proyectan una imagen ... que se llama el
mundo dual ... Tipo Alicia en el Pas de las Maravillas ... El mundo donde todo cambia de
sentido .. la izquierda es la derecha y viceversa ..
Con este "Espejo" ... el 508 .. lo veramos como 805 .... al que si le podramos llamar en
propiedad su espejo ...
Alabado sea el seor ... si con esta explicacin corta .. llega la suficiente luz a tu intelecto y
logras descifrar el mundo de la numerologia loteril ...
Saludos .. Un placer de antemano ...
Beremiz
Mensajes: 235
Registrado: 05 Ene 2012, 20:37

por sjllove el 09 Jul 2014, 15:40
felicitaciones malba tahan por tan concisa y precisa informacion ,que buena .de verdad que
admiro tu talento y dios permita que puedas transmitirlo a muchos de tus decendientes .que
asi sea amen.
sjllove

por sofiaandrea el 09 Jul 2014, 17:11
BUENAS TARDES, GRACIAS POR LA INFORMACIN SUMINISTRADA A GANAR SE HA DICHO BUENAS

TARDES
Re: PARA EL AMIGO BEREMIZ

por sjllove el 08 Oct 2014, 08:56
muchas graciasamigo deltadelorinoco espero que consigas pronto esa formula de la centena .
sjllove
Mensajes: 654
Registrado: 29 Dic 2010, 08:10
A
r
r
i
b
a

por Beremiz el 09 Oct 2014, 10:01
Saludos Sjllove ....

Hagamos un conversatorio de ideas ... con el animo de activar las neuronas y aclarar
muchos conceptos relativos a la forma como mucha gente interpreta tales ideas ...
1) La estadstica o el tratamiento estadstico de DATA ... se usa para estudiar el pasado
conocido. Aunque hay una parte de ella en donde se puede hacer INFERENCIAS .. que
seria como la verificacin de hechos notables en ese fenmeno estudiado a travs de esa
data. Con la inferencia estadstica nos proponemos hiptesis que logramos verificar a
travs de pruebas conocidas y creadas para tal fin. As aprendemos a no caer en la
tentacin de estar haciendo CONJETURAS a diestra y siniestra ... y tenemos la firme
conviccin de estar usando con propiedad los conceptos estadsticos con la significativa
validez que tales pruebas nos permiten.
2) Un pronstico es una proyeccin a futuro .. algo que esperamos ocurra en un futuro
cercano .. lo suficiente como para lograr xito en el pronstico. La idea del pronstico se
basa en entender que pasara si ... dadas ciertas condiciones se puede llegar a la
conclusin que conlleva a dar ese pronstico. Es decir cumplido un evento cualquiera ..
que podemos inferir sobre esa premisa y que consecuencia acarrea que ella se cumpla ...
Es un acto condicional. las probabilidades condicionales son las que se hacen alusin en el
teorema de bayes y que nombrabas. Aqu un ejemplo loteril ...supongamos que el digito
9 .. tiene una probabilidad de salir en la UNIDAD de 0,25 .. es decir sale un 9 cada 4
sorteos ... Intentamos entonces inferir cual seria la probabilidad de que salga el terminal
39 ? Observa que el evento salida del 39 esta sujeto a la salida del 9 en la UNIDAD.
Observa que cada digito en la unidad es Equiprobable su salida es decir 0.1 su
probabilidad, la salida del dgito 9 tiene una ventaja sobre los dems que asumimos como
UN PATRON significativo de comportamiento.

3) Un suceso se le dice seguro ... si su probabibilidad de ocurrencia es 0 o 1 ... en el caso
de 0 estamos seguro de su NO OCURRENCIA y en el caso de 1 .. en que siempre OCURRE.
El grado de sorpresa esta condicionado a este tipo de sucesos...
... Mucha gente asume que sus conjeturas son sucesos seguros ... le dicen INFALIBLES ..
IMPELABLES .. Este no pierde con nadie ... y cuando ocurre lo contrario ... Guao ...
asombrados .. que paso ? Recuerda NO HAY NADA MEJOR que un pronstico loteril para
HACER EL RIDICULO ...
4) Pensemos en una situacin hipotetica suponte que la loteria es tan "buena" .. que cada
vez que salga el TRIPLE X .. al ratico aparezca el triple Y ... Es razonable esta rigidez ? ..
podramos tambin suponer que es "muy buena" y haga eso en la misma operadora ... que
veramos como resultados ... UN PATRON RIGIDO de comportamiento ... nada parecido a lo
que vemos en los hechos ... Esa es la idea "Del Siguiente" .. del "Viene" ... mal
interpretada ... Ese PATRON DE BUSQUEDA es ms complejo que eso, tal como lo usan
para pronosticar ...
5) Pareciera que en efecto hay mucha afinidad entre ciertos elementos de la loteria ...
Pero hacemos las cosas bien o no la hacemos ... pues JUGAR LOTERIA bajo esa enorme
incertidumbre .. el resultado es PERDER PERDER ...
6) Te pondr en perspectiva un ejemplo mas sencillo ... UN DIGITO ... y su busqueda ...
observa la secuencia ...
1 0 1 0 1 0 1 0 ... el siguiente es un 1 ... quien podra dudar de eso ?
854891934128413055161536 382 .... cual dgito viene ? la cuestin se complic ...
verdad ?
imaginate entonces .... si sali el 854 ... como asegurar que viene el 891 ?
Hagamos algunas conjeturas ... decimos el dgito que viene a continuacin es el 0 .. cmo
podriamos asegurar eso ... si en la secuencia de dgitos hay un solo 0 ... hay que ser
adivino para acertar que viene el 0 ... pues como hacer esa afirmacin si solo tenemos un
solo elemento ... para el anlisis.
Suponte que decimos que viene el 8 .. veamos si el digito 8 tiene algn patrn
conocido ....
a) distancia entre entre el primer 8 y el segundo 8 = 2-dgitos
b) distancia entre el segundo y el tercero = 7-dgitos
c) distancia entre el tercero y el cuarto = 13-dgitos
Observa la secuencia que se forma ... 2 - 7 - 13 .... y observa ... 7 - 2 = 5 ... 13 - 7 = 6

que es una incipiente progresin aritmetica de razn 1 .... 5 6 7 8 9 ....
Basado en este anlisis podemos atrevernos a conjeturar que el prximo 8 estara en la
posicin P tal que ... P - 13 = 7
entonces P = 20 ... es decir ... el prximo 8 estara a 20 dgitos del ltimo que se tiene ...
To be or not to be ? Its The question. !!!! Pero no duda que un anlisis como este es mas
serio y razonable ...
Es de alta complejidad una busqueda como esta ... Valdra la pena gastar tanto tiempo en
algo como esto ? Una amiga hace algn tiempo me dijo ... Hazlo ... y cuando tengas el
triple .. me lo das !!!! As espera mucha gente .... que se lo den .. y GRATIS ... y te ponen
la coletilla al lado ... QUE BONITO ES COMPARTIR ... S .. no hay duda ... pero siempre lo
de UNO .. no lo de ellos !!!! GRACIAS POR COMPARTIR .. Otros son ms OSADOS ... dame el
mtodo ... y cuando obtenga resultados ... Te los mando !!!! ... Jajaja .. hay que esperar
PARADOS .. sentados se pondrn chatas las nalgas !!!!
Beremis ... a sus gratas ordenes. Los modelos probabilsticos despus de una pausa de fin
de semana ..
Beremiz
Mensajes: 235
Registrado: 05 Ene 2012, 20:37
A
r
r
i
b
a

Muchas gracias beremiz es comprencible lo que dices todo cuesta y mucho mas esto que tiene
que ver con dinero ser o no ser esa es la cuestion.yo pagaria por tu informacion loteril .puedo
solicitar tu correo y ponernos de acuerdo .se que eres bueno en esto ya que hace mucho
tiempo veo tus apariciones en varios foros.
sjllove
Mensajes: 654
Registrado: 29 Dic 2010, 08:10
A
r
r
i
b
a

por investigadorloteril el 10 Oct 2014, 15:52
jajajajajaj Profesor Beremiz tiene toda la razn

eso me ha pasado montones de veces, claro
tambin buenos intercambios reales y ademas
anlisis muy buenos que ambas partes nos
hemos beneficiado, es la idea, al final nadie
tiene la razn, ya que una tcnica exacta no
existe, es un acorralamiento de los nmeros a
travs de distintas tcnicas o mtodos, que
tienen que ser muy frecuentes sus aciertos para
que puedan un punto de encuentro comn,
generando as un grupo de triples que tengan
oportunidad de salida.
investigadorloteril
Mensajes: 1096
Registrado: 05 Sep 2012, 11:38
Ubicacin: Venezuela-Carabobo.
A
r
r
i
b
a

buenas noches amigo beremiz o el investigador .les queria pedir por favor si podrian
explicarnos este sistema rutiliano
He aqu una regla, presumiblemente rutiliana, conveniente para ganar con el nmero
simptico para cualquier mes. La reproduzco fielmente como ha sido transmitida por el
astrnomo, fsico y cabalista veneciano Pietro Casamia: Para realizar esta operacin, es decir
para obtener el verdadero nmero simptico mensual, conviene en primer lugar saber cuantos
das tenga la luna en aquellos primeros das del mes por cul se querr obrar.
79 12 86
71315
8446
381

El Metodo Del Espejo en La Loteria

Încărcat de

Informații document

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

El Metodo Del Espejo en La Loteria

Încărcat de

Drepturi de autor:

Formate disponibile

http://www.lottoforums.

Muchas personas dejan la eleccin de

de lotera. Algunos de estos sistemas

Existen 3 formatos de esta estrategia:

determinado. Podemos combinar

Join Date: Aug 2010

Welcome to the forum!

Join Date: Sep 2013

Join Date: Aug 2010

Originally Posted by Ramijami

Join Date: Sep 2013

Join Date: Aug 2010

Thanks for the explanation.

Join Date: Oct 2007

Join Date: Aug 2010

I did some further investigation into this problem.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.

Also called Lam's sequence.

Branko Malesevic, Mar 02 2004

For n>0, the continued fraction for F(2n-1)*Phi=[F(2n);L(2n-1),L(2n-1),L(2n-1),...]

Output of Kasteleyn's formula for the number of perfect matchings of an m x n grid

Bottomley, Feb 10 2010

Ravi Kumar Davala, Jan 30 2014, (Start)

Consider: F(n+2)^2 - F(n)*F(n+1) - 2F(n+1)^2

numbers of compositions using parts 1 and k is equivalent to the numbers of

2009. - Charlie Marion, Jan 07 2014

Abrate, Marco; Barbero, Stefano; Cerruti, Umberto; Murru, Nadir. Colored

Mathematics, Princeton Univ. Press, 1999. See p. 84.

Southeastern International Conference on Combinatorics, Graph Theory and Computing

N. N. Vorobiev, Fibonacci Numbers, Birkhauser (Basel;Boston) 2002.

Vol. 3 (2000), #00.1.5.

S. Happersett, Mathematical meditations

B. Malesevic, Some combinatorial aspects of differential operation composition on the

Sequences, 10 (2007), Article 07.2.4.

Willem's Fibonacci site, Fibonacci

p = 5. (This is essentially Theorem 180 in Hardy and Wright.) - Fred W. Helenius

Fibonacci(n)=Product(1 + 4[cos(j*Pi/n)]^2, j=1..ceil(n/2)-1). [Bicknell and Hoggatt,

F(n*m) = Sum{k = 0..m, binomial(m,k)*F(n-1)^k*F(n)^(m-k)*F(m-k)}. The generating

L(n)= A000032(n). - Johannes W. Meijer, May 27 2010

Hieronymus Fischer, Nov 30 2012: (Start)

sum_{j_1=1..n-2} sum_{j_2=1..j_1-2} sum_{j_3=1..j_2-2} 1 + ... + sum_{j_1=1..n-2}

G.f. A(x) = x / (1 - x / (1 - x / (1 + x))). - Michael Somos, Jan 04 2013

floor(b(n-1)) if n is even, F(n) = ceil(b(n-1)), if n is odd, with convergence.

A000045 := proc(n) combinat[fibonacci](n); end;

Table[ Fibonacci[ k ], {k, 1, 50} ]

2^(n) Product[((Cos[Pi k/(n + 1)])^2 + (Cos[Pi 1/3])^2)^(1/4), {k, n}]

(Axiom) [fibonacci(n) for n in 0..50]

(Sage) ## Demonstration program from Jaap Spies:

A039834 (signed Fibonacci

A000071, A157725, A001911, A157726,A006327, A157727, A157728, A157729, A167616

A000042 A000043 A000044 * A000046 A000047 A000048

N. J. A. Sloane, Apr 30 1991

(Greetings from The On-Line Encyclopedia of Integer Sequences!)

1, 1, 1, 1, 2, 2, 1, 3, 5, 4, 1, 4, 9, 12, 9, 1, 5, 14, 25, 30, 21, 1, 6, 20, 44, 69,

Right-hand columns have g.f. M^k, where M is g.f. of Motzkin numbers.

M. Aigner, Motzkin Numbers, Europ. J. Comb. 19 (1998), 663-675.

Reinhard Zumkeller, Rows n = 0..120 of triangle, flattened

M. Buckley, R. Garner, S. Lack, R. Street, Skew-monoidal categories and

Motzkin numbers (A001006) are T(n, n), other columns of T

A026297 A026298 A026299 * A026301 A026302 A026303

Corrected and edited by Johannes W. Meijer, Oct 05 2010

The ISOLATOR (REVISED)

Join Date: Jan 2006

F(nm) = Sum{k = 0..m, binomial(m,k)F(n-1)^kF(n)^(m-k)F(m-k)}. The generating