id:A102706 - OEIS Search Results

Search: id:A102706

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n^3 into n primes such that n-1 are consecutive primes and the remaining prime is larger than the sum of the n-1 consecutive primes.

+0
3

0, 0, 1, 1, 1, 1, 2, 2, 0, 2, 3, 6, 3, 2, 2, 5, 7, 10, 8, 9, 5, 5, 9, 15, 10, 8, 4, 5, 15, 27, 15, 17, 15, 20, 25, 18, 19, 18, 14, 21, 21, 27, 22, 19, 22, 22, 28, 31, 29, 25, 22, 27, 35, 43, 35, 34, 27, 42, 40, 46, 45, 53, 36, 33, 48, 46, 53, 34, 39, 57, 53, 50, 47, 39, 63, 66, 60 (list; graph; listen)

	OFFSET	`0,7`
	EXAMPLE	`a(2)=1 since 2^3 = 8 = 3+5;` `a(6)=2 since 6^3 = 216 = 5+7+11+13+17+163 = 7+11+13+17+19+149;` `a(8)=0 since no such partition exists for 8^3.`
	CROSSREFS	`Cf. A102352.` `Sequence in context: A072738 A165316 A141058 this_sequence A105673 A074823 A159916` `Adjacent sequences: A102703 A102704 A102705 this_sequence A102707 A102708 A102709`
	KEYWORD	`nonn`
	AUTHOR	`Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Feb 05 2005`
	EXTENSIONS	`Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net) Feb 25 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research