id:A081308 - OEIS Search Results

Search: id:A081308

Displaying 1-1 of 1 results found.

page 1

Number of ways to write n as sum of a prime and an 3-smooth number.

+0
6

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

	OFFSET	`1,4`
	EXAMPLE	`a(12)=2: 12=11+1=3+3^2; a(13)=3: 13=11+2=7+2*3=5+2^3.`
	CROSSREFS	`Cf. A081310, A081311, A081309, A000040, A003586.` `Sequence in context: A031266 A109301 A107573 this_sequence A070210 A100198 A164996` `Adjacent sequences: A081305 A081306 A081307 this_sequence A081309 A081310 A081311`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 17 2003`

page 1

Search completed in 0.002 seconds

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.

AT&T Labs Research