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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068413 a(n) = number of partitions of 2^n. 12
 1, 2, 5, 22, 231, 8349, 1741630, 4351078600, 365749566870782, 4453575699570940947378, 61847822068260244309086870983975, 18116048323611252751541173214616030020513022685, 6927233917602120527467409170319882882996950147283323368445315320451 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..19 Henry Bottomley, Partition calculators using java applets FORMULA a(n) = A000041(A000079(n)). a(n) ~ exp(Pi*sqrt(2^(n+1)/3))/(sqrt(3)*2^(n+2)). - Ilya Gutkovskiy, Jan 13 2017 EXAMPLE a(2)=5 since there are 5 partitions of 2^2=4: 4, 3+1, 2+2, 2+1+1, 1+1+1+1+1. MATHEMATICA Table[ PartitionsP[2^n], {n, 0, 12}] CROSSREFS Cf. A000041, A000079, A018819, A067735. Sequence in context: A193660 A090450 A137099 * A137069 A050994 A326959 Adjacent sequences:  A068410 A068411 A068412 * A068414 A068415 A068416 KEYWORD nonn AUTHOR Henry Bottomley, Mar 03 2002 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.

Last modified February 20 17:04 EST 2020. Contains 332080 sequences. (Running on oeis4.)