Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162962
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162962 a(n) = 5*a(n-2) for n > 2; a(1) = 1, a(2) = 5. +0
2
1, 5, 5, 25, 25, 125, 125, 625, 625, 3125, 3125, 15625, 15625, 78125, 78125, 390625, 390625, 1953125, 1953125, 9765625, 9765625, 48828125, 48828125, 244140625, 244140625, 1220703125, 1220703125, 6103515625, 6103515625, 30517578125 (list; graph; listen)
OFFSET

1,2

COMMENT

Apparently a(n) = A074872(n+1), a(n) = A056451(n-1) for n > 1.

Binomial transform is A084057 without initial 1, second binomial transform is A048876, third binomial transform is A082762, fourth binomial transform is A162769, fifth binomial transform is A093145 without initial 0.

FORMULA

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

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

PROGRAM

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

CROSSREFS

Cf. A000351 (powers of 5), A074872 (powers of 5 repeated), A056451 (5^floor((n+1)/2)), A084057, A048876, A082762, A162769, A093145.

Sequence in context: A071340 A056451 A074872 this_sequence A154630 A038247 A093643

Adjacent sequences: A162959 A162960 A162961 this_sequence A162963 A162964 A162965

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research