id:A101182 - OEIS Search Results

Search: id:A101182

Displaying 1-1 of 1 results found.

page 1

Least positive integer that can be represented as the sum of a prime and a triangular number in exactly n ways.

+0
1

1, 2, 3, 8, 17, 83, 47, 89, 107, 212, 194, 347, 284, 674, 524, 464, 467, 947, 662, 1187, 1514, 1304, 1019, 1229, 1559, 2189, 1724, 2699, 2084, 3434, 2417, 4022, 3467, 3824, 3764, 3362, 5324, 5879, 5672, 7214, 5927, 6179, 6134, 7079, 6704, 7727, 10667 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n) = min{i such that i = A000040(j) + A000217(k) in n ways}.`
	EXAMPLE	`a(0) = 1 because 1 is the smallest positive integer that cannot be represented as sum of a prime and a triangular number (since 2 is the smallest prime).` `a(1) = 2 = 2 + 0; a(2) = 3 = 3 + 0 = 2 + 1; a(3) = 8 = 2 + 6 = 5 + 3 = 7 + 1.`
	CROSSREFS	`Cf. A000040, A000217, A076768.` `Sequence in context: A148036 A148037 A099960 this_sequence A009207 A096254 A091765` `Adjacent sequences: A101179 A101180 A101181 this_sequence A101183 A101184 A101185`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jonathan Vos Post (jvospost3(AT)gmail.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 14 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research