id:A114912 - OEIS Search Results

Search: id:A114912

Displaying 1-1 of 1 results found.

page 1

2^a(n) divides A000009(n) but 2^(a(n)+1) does not.

+0
3

0, 0, 0, 1, 1, 0, 2, 0, 1, 3, 1, 2, 0, 1, 1, 0, 5, 1, 1, 1, 6, 2, 0, 3, 1, 1, 0, 6, 1, 8, 3, 2, 1, 6, 9, 0, 2, 3, 5, 1, 0, 2, 1, 1, 3, 11, 8, 1, 1, 6, 1, 0, 1, 10, 1, 1, 2, 0, 3, 6, 7, 2, 1, 9, 2, 3, 2, 1, 13, 1, 0, 5, 9, 1, 1, 1, 1, 0, 1, 3, 9, 2, 6, 1, 1, 6, 6, 1, 1, 1, 1, 11, 0, 5, 6, 1, 2, 8, 6, 1, 0, 1 (list; graph; listen)

	OFFSET	`0,7`
	COMMENT	`Almost all members of A000009 are divisible by 2^k for any k, therefore almost all a(n)>k for any k.`
	LINKS	`K. Alladi, Partition Identities Involving Gaps and Weights, Transactions of the American Mathematical Society, Vol. 349, No. 12, Dec 1997, pp. 5001-5019.` `Basil Gordon and Ken Ono, Divisibility of Certain Partition Functions By Powers of Primes.`
	CROSSREFS	`The 0's are in A001318. The 1's are in A114913. Least inverse A115251.` `Sequence in context: A143359 A130504 A044942 this_sequence A029274 A079219 A124377` `Adjacent sequences: A114909 A114910 A114911 this_sequence A114913 A114914 A114915`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Jan 06 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research