Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090479 Beginning with 1, least number such that filling the first n gaps with numbers from 1 to n yields primes in every case. +0
2
1, 3, 1, 9, 61, 1, 1, 31, 23, 39, 163, 29, 21, 47, 57, 13, 7, 221, 39, 73, 89, 63, 743, 451, 461, 111, 243, 73, 203, 31, 11, 417, 171, 147, 23, 191, 27, 37, 241, 1207, 1003, 143, 191, 243, 279, 247, 331, 233, 947, 107, 169, 673, 301, 2711, 977, 789, 111, 417, 221 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research