login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085526 a(n) = n^(2n+1). 3
0, 1, 32, 2187, 262144, 48828125, 13060694016, 4747561509943, 2251799813685248, 1350851717672992089, 1000000000000000000000, 895430243255237372246531, 953962166440690129601298432, 1192533292512492016559195008117, 1728673739677471101567216945987584, 2876265888493261300027370452880859375 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..15.

FORMULA

a(n) = n*A062206(n). - R. J. Mathar, Mar 11 2017

a(n) = [x^(2*n+1)] 1/(1 - n*x). - Ilya Gutkovskiy, Oct 10 2017

MATHEMATICA

Table[n^(2*n+1), {n, 0, 20}] (* Vladimir Joseph Stephan Orlovsky, Apr 19 2011 *)

CROSSREFS

Cf. A062206.

Sequence in context: A294607 A294953 A239402 * A101441 A321663 A264145

Adjacent sequences:  A085523 A085524 A085525 * A085527 A085528 A085529

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Jul 05 2003

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 15:30 EST 2021. Contains 349420 sequences. (Running on oeis4.)