0,2

Same as Pisot sequences E(1,5), L(1,5), P(1,5), T(1,5). See A008776 for definitions of Pisot sequences.

a(n) has leading digit 1 iff n = A067497 - 1. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 09 2002

With interpolated zeros 0,1,0,5,0,25,... (G.f.: x/(1-5x^2)) second inverse binomial transform of Fib(3n)/F(3) (A001076). Binomial transform is A085449. - Paul Barry (pbarry(AT)wit.ie), Mar 14 2004

Sums of rows of the triangles in A013620 and A038220. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 14 2006

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Tanya Khovanova, Recursive Sequences

P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 270

Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.

Eric Weisstein's World of Mathematics, Box Fractal

a(n) = 5^n; a(n) = 5a(n-1).

G.f.: 1/(1-5x), e.g.f.: exp(5x)

[ seq(5^n, n=0..30) ];

A000351:=-1/(-1+5*z); [Conjectured by S. Plouffe in his 1992 dissertation.]

Table[5^n, {n, 0, 30}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 06 2006

a(n) = A006495(n)^2 + A006496(n)^2.

Adjacent sequences: A000348 A000349 A000350 this_sequence A000352 A000353 A000354

Sequence in context: A129066 A102169 A060391 this_sequence A050735 A083590 A097680

easy,nonn,nice

njas