|
Search: id:A097487
|
|
|
| A097487 |
|
Write each natural nonprime integer >0 on a single label. Put the labels in numerical order to form an infinite sequence L. Now consider the succession of single digits of A000040 (prime numbers): 0,2,3,5,7,1,1,1,3,1,7,1,9,2,3,2,9,3,1,3,7,4,1,4,3,4,7,5,3,5,9,6,1,6,7,7,1,7,3,7,9,8,3,8,9,9,7,1,0,1,1,0,3,1,0,7... (A033308). The sequence S gives a rearrangement of the labels that reproduces the same succession of digits, subject to the constraint that the smallest label must be used that does not lead to a contradiction. |
|
+0
4
|
|
| 235, 711, 1, 3171, 9, 232, 93, 1374, 14, 34, 75, 35, 96, 16, 77, 1737, 98, 38, 99, 710, 110, 310, 71091, 1312, 713, 1137, 1391, 4, 91, 51, 15, 716, 316, 717, 3179, 18, 119, 11931, 97199, 21, 12, 2322, 72, 292, 33, 2392, 412, 512, 57, 26, 32, 69, 27
(list; graph; listen)
|
|
|
OFFSET
|
235,1
|
|
|
COMMENT
|
This could be roughly rephrased like this: "Re-write in the most economical way the prime numbers 'pattern' using only nonprime numbers. No two same nonprimes will be used."
|
|
REFERENCES
|
E. Angelini, "Jeux de suites", in Dossier Pour La Science, pp. 32-35, Volume 59 (Jeux math'), April/June 2008, Paris.
|
|
EXAMPLE
|
We must begin with 2,3,5,7,11,13,..., and we cannot represent "2" by the label "2" or "23", so the next possibility is the label "235" (first available nonprime number in L). Labels of L cannot be used more than once.
|
|
CROSSREFS
|
Cf. A097968, A098099, A098067.
Sequence in context: A077803 A049857 A132903 this_sequence A091427 A068663 A129857
Adjacent sequences: A097484 A097485 A097486 this_sequence A097488 A097489 A097490
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Sep 19 2004; corrected Sep 23 2004
|
|
|
Search completed in 0.002 seconds
|
