id:A101181 - OEIS Search Results

Search: id:A101181

Displaying 1-1 of 1 results found.

page 1

Least positive integer that can be represented as sum of a semiprime and a square in exactly n ways.

+0
2

1, 4, 13, 10, 26, 50, 58, 74, 146, 159, 218, 302, 290, 458, 515, 647, 650, 794, 962, 986, 1178, 1403, 1322, 1418, 1658, 1898, 1802, 2126, 1970, 2210, 3062, 2930, 3143, 3263, 3482, 3527, 4142, 4667, 4010, 4562, 5123, 4955, 5018, 6242, 5330, 6695, 7178, 7103 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n) = min(i such that i = A001358(j) + A000290(k) in n ways).`
	EXAMPLE	`a(0) = 1 because 1 is the smallest positive integer that cannot be represented as sum of a semiprime and a square (since 4 is the smallest semiprime).` `a(1) = 4 = 4 + 0; a(2) = 13 = 4 + 9 = 9 + 4; a(3) = 10 = 6 + 4` `= 9 + 1 = 10 + 0.`
	CROSSREFS	`Cf. A000290, A001358, A100570.` `Sequence in context: A046737 A046738 A095324 this_sequence A136137 A050223 A081738` `Adjacent sequences: A101178 A101179 A101180 this_sequence A101182 A101183 A101184`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jonathan Vos Post (jvospost2(AT)yahoo.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 14 2004`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research