Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013791
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A013791 9^(4n+3). +0
2
729, 4782969, 31381059609, 205891132094649, 1350851717672992089, 8862938119652501095929, 58149737003040059690390169, 381520424476945831628649898809, 2503155504993241601315571986085849, 16423203268260658146231467800709255289 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

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

CROSSREFS

Sequence in context: A017022 A017106 A017202 this_sequence A017310 A017430 A017562

Adjacent sequences: A013788 A013789 A013790 this_sequence A013792 A013793 A013794

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research