id:A093712 - OEIS Search Results

Search: id:A093712

Displaying 1-1 of 1 results found.

page 1

Repeatedly subtract largest prime from n until either a prime or 1 remains.

+0
1

1, 2, 3, 31, 5, 51, 7, 71, 72, 73, 11, 111, 13, 131, 132, 133, 17, 171, 19, 191, 192, 193, 23, 231, 232, 233, 2331, 235, 29, 291, 31, 311, 312, 313, 3131, 315, 37, 371, 372, 373, 41, 411, 43, 431, 432, 433, 47, 471, 472, 473, 4731, 475, 53, 531, 532, 533, 5331, 535 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The representation as strings of primes is similar to the Zeckendorf expansion, A035514's strings of Fibonacci numbers.`
	EXAMPLE	`a(8) = 71 because 8 = 7 + 1.`
	CROSSREFS	`Cf. A000040, A035514.` `Sequence in context: A110351 A088115 A048986 this_sequence A035514 A114009 A074479` `Adjacent sequences: A093709 A093710 A093711 this_sequence A093713 A093714 A093715`
	KEYWORD	`easy,nonn,base`
	AUTHOR	`Michael Joseph Halm (hierogamous(AT)lycos.com), May 17 2004`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research