Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013790
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013790 9^(4n+1). +0
2
9, 59049, 387420489, 2541865828329, 16677181699666569, 109418989131512359209, 717897987691852588770249, 4710128697246244834921603689, 30903154382632612361920641803529, 202755595904452569706561330872953769 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n)=6561*a(n-1), n>0 ; a(0)=9 . G.f.: 9/(1-6561*x). a(n)=A013791(n)/81. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Dec 07 2008]

CROSSREFS

Sequence in context: A053921 A159398 A053971 this_sequence A058452 A058456 A014381

Adjacent sequences: A013787 A013788 A013789 this_sequence A013791 A013792 A013793

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research