id:A067953 - OEIS Search Results

Search: id:A067953

Displaying 1-1 of 1 results found.

page 1

Number of ways to sum numbers from 1 to n to the n-th prime.

+0
6

0, 1, 1, 2, 2, 4, 7, 13, 23, 39, 69, 122, 211, 339, 564, 1001, 1764, 2630, 4565, 7192, 10151, 17202, 26152, 43543, 79126, 117496, 156229, 227302, 295011, 422040, 1004905, 1423445, 2210752, 2796140, 5225780 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`a(n) = b(0, n), where b(m, n) satisfies b(m, n) = 1 + sum{b(i, j): m<i<j<n & i+j=prime(n)}.` `a(n) < A000009(A000040(n)).`
	EXAMPLE	`a(6)=4, as there are 4 decompositions for A000040(6)=13:` `6+5+2 = 6+4+3 = 6+4+2+1 = 5+4+3+1 = 13.`
	CROSSREFS	`Sequence in context: A000983 A095325 A153970 this_sequence A109070 A049868 A120363` `Adjacent sequences: A067950 A067951 A067952 this_sequence A067954 A067955 A067956`
	KEYWORD	`nonn,nice`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 06 2002`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research