login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016807 (4*n)^7. 1
0, 16384, 2097152, 35831808, 268435456, 1280000000, 4586471424, 13492928512, 34359738368, 78364164096, 163840000000, 319277809664, 587068342272, 1028071702528, 1727094849536, 2799360000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Generating function is 128 times the g.f. of A016747. - R. J. Mathar, May 07 2008

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..10000

FORMULA

a(n)= 128*A016747(n). - R. J. Mathar, May 07 2008

PROG

(MAGMA) [(4*n)^7: n in [0..30]]; // Vincenzo Librandi, Sep 05 2011

CROSSREFS

Sequence in context: A115348 A218528 A016783 * A231845 A223967 A016903

Adjacent sequences:  A016804 A016805 A016806 * A016808 A016809 A016810

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 15:08 EST 2016. Contains 278945 sequences.