Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A017623
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A017623 (12n+8)^7. +0
1
2097152, 1280000000, 34359738368, 319277809664, 1727094849536, 6722988818432, 20971520000000, 55784660123648, 131593177923584, 282621973446656, 562949953421312, 1054135040000000, 1874584905187328 (list; graph; listen)
OFFSET

0,1

COMMENT

The generating function is 16384 times the g.f. of A016795. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 11 2008

FORMULA

a(n)=16384*A016795(n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 11 2008

CROSSREFS

Sequence in context: A017263 A017371 A017491 this_sequence A017706 A010809 A017705

Adjacent sequences: A017620 A017621 A017622 this_sequence A017624 A017625 A017626

KEYWORD

nonn,easy

AUTHOR

njas

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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research