id:A111651 - OEIS Search Results

Search: id:A111651

Displaying 1-1 of 1 results found.

page 1

n appears 3n times.

+0
3

1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`a(n) = nearest integer to cube root of n. - Jonathan Vos Post (jvospost3(AT)gmail.com), Sep 06 2006` `Expansion of (q/(1-q))psi(q^3) in powers of q where psi() is a Ramanujan theta function. - Michael Somos Aug 31 2006` `G.f.: x/(1-x)*Product_{k>0} (1-x^(3k))^((-1)^k).`
	PROGRAM	`(PARI) {a(n)=if(n<1, 0, polcoeff( x/(1-x)prod(k=1, n\3, (1-x^(3k))^(-1)^k, 1+O(x^n)), n))} /* Michael Somos Aug 31 2006 */`
	CROSSREFS	`Cf. A000194, A008585, A111650, A111652.` `Cf. A000194.` `Sequence in context: A099396 A126235 A056556 this_sequence A151982 A111854 A132085` `Adjacent sequences: A111648 A111649 A111650 this_sequence A111652 A111653 A111654`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jonathan Vos Post (jvospost3(AT)gmail.com), Aug 12 2005`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research