id:A088934 - OEIS Search Results

Search: id:A088934

Displaying 1-1 of 1 results found.

page 1

Maximum prime required for the representation of n by a signed sum of squares of distinct primes that has the minimal number of terms A088910(n).

+0
4

19, 13, 19, 13, 2, 3, 13, 19, 13, 3, 13, 7, 5, 3, 13, 7, 5, 13, 13, 7, 5, 5, 19, 13, 7, 5, 13, 13, 7, 5, 5, 19, 13, 7, 5, 13, 7, 7, 5, 13, 7, 17, 11, 11, 7, 7, 17, 11, 13, 7, 17, 11, 13, 7, 7, 17, 11, 13, 7, 11, 11, 7, 7, 11, 13, 7, 17, 11, 11, 7, 7, 17, 11, 13, 7, 17, 11, 11, 7, 7, 17, 11 (list; graph; listen)

	OFFSET	`0,1`
	EXAMPLE	`See example in A088910.`
	CROSSREFS	`Cf. A089294 representation minimizing the maximum occurring prime instead of minimizing the number of terms, A089297 representation of the squares of primes by squares of distinct other primes.` `Sequence in context: A083156 A040344 A089294 this_sequence A155848 A088399 A106706` `Adjacent sequences: A088931 A088932 A088933 this_sequence A088935 A088936 A088937`
	KEYWORD	`nonn`
	AUTHOR	`Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 06 2003`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research