id:A062303 - OEIS Search Results

Search: id:A062303

Displaying 1-1 of 1 results found.

page 1

Number of ways writing n-th prime as a sum of a nonprime and a composite.

+0
1

1, 0, 1, 1, 1, 2, 2, 3, 3, 5, 6, 7, 8, 9, 9, 11, 13, 14, 15, 16, 17, 18, 19, 21, 24, 25, 26, 26, 27, 27, 33, 34, 36, 37, 40, 41, 42, 44, 45, 47, 49, 50, 53, 54, 54, 55, 59, 64, 65, 66, 66, 68, 69, 72, 74, 76, 78, 79, 80, 81, 82, 85, 91, 92, 93, 93, 99, 101, 105, 106, 106, 108 (list; graph; listen)

	OFFSET	`0,6`
	FORMULA	`A062610(A000040(n)) = number of [nonprime+composite] partitions of p(n).`
	EXAMPLE	`n=10,p(10)=29 has 14 partitions of form a+b=29; 1+28=4+25=8+21=9+20=14+15 are the 5 relevant partitions, so a(10)=5.`
	CROSSREFS	`A061358, A062602, A062610, A000040, A014092, A025584.` `Adjacent sequences: A062300 A062301 A062302 this_sequence A062304 A062305 A062306` `Sequence in context: A032244 A063988 A097450 this_sequence A050318 A130841 A002095`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 05 2001`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research