id:A079058 - OEIS Search Results

Search: id:A079058

Displaying 1-1 of 1 results found.

page 1

Least k such that A025591(k)>p(n) (p(n)=the n-th partition number).

+0
1

1, 3, 5, 6, 7, 8, 9, 9, 10, 11, 11, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27, 28, 28, 28, 28, 28, 29, 29, 29, 29, 30, 30 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n) is asymptotic to C*sqrt(n) with 3.5<C<3.6... Is it true that C = exp(Pi/sqrt(6))?`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, k=1; while(polcoeff(prod(i=1, k, 1+x^i), k*(k+1)\4)-polcoeff(1/eta(x), n)<0, k++); k)`
	CROSSREFS	`Cf. A000041.` `Sequence in context: A122818 A070083 A004220 this_sequence A036496 A009004 A005527` `Adjacent sequences: A079055 A079056 A079057 this_sequence A079059 A079060 A079061`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 02 2003`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research