Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101553 A modular recurrence. +0
2
1, 5, 15, 75, 225, 1125, 3375, 16875, 50625, 253125, 759375, 3796875, 11390625, 56953125, 170859375, 854296875, 2562890625, 12814453125, 38443359375, 192216796875, 576650390625, 2883251953125, 8649755859375, 43248779296875 (list; graph; listen)
OFFSET

0,2

COMMENT

Interpolated zeros suppressed.

FORMULA

a(0)=1, a(1)=0, a(n)=(3+2*mod(n/2, 2))a(n-2). a(n)=A100747(2(n+1))/3.

a(2n) = 15^n, a(2n+1) = 5*15^n. - Ralf Stephan, May 16 2007

CROSSREFS

Sequence in context: A019045 A066886 A079569 this_sequence A032122 A064678 A088935

Adjacent sequences: A101550 A101551 A101552 this_sequence A101554 A101555 A101556

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 06 2004

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research