Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162963
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162963 a(n) = 5*a(n-2) for n > 2; a(1) = 2, a(2) = 5. +0
5
2, 5, 10, 25, 50, 125, 250, 625, 1250, 3125, 6250, 15625, 31250, 78125, 156250, 390625, 781250, 1953125, 3906250, 9765625, 19531250, 48828125, 97656250, 244140625, 488281250, 1220703125, 2441406250, 6103515625, 12207031250 (list; graph; listen)
OFFSET

1,1

COMMENT

Apparently a(n) = A026383(n) for n >= 1.

Binomial transform is A162770, second binomial transform is A001077 without initial 1, third binomial transform is A162771, fourth binomial transform is A162772, fifth binomial transform is A162773.

FORMULA

a(n) = (3-(-1)^n)*5^(1/4*(2*n-1+(-1)^n))/2.

G.f.: x*(2+5*x)/(1-5*x^2).

PROGRAM

(MAGMA) [ n le 2 select 3*n-1 else 5*Self(n-2): n in [1..29] ];

CROSSREFS

Cf. A000351 (powers of 5), A026383, A001077, A162770, A162771, A162772, A162773.

Sequence in context: A018262 A018356 A026383 this_sequence A002094 A115725 A079572

Adjacent sequences: A162960 A162961 A162962 this_sequence A162964 A162965 A162966

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 19 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research