Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046872
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046872 F-primes. +0
2
7, 47, 191, 239, 307, 463, 499, 701, 743, 787, 853, 1087, 1123, 1301, 1487, 1553, 1567, 1823, 2309, 2621, 2843, 2903, 3083, 3203, 3319, 3323, 3359, 3373, 3541, 3583, 3557, 3617, 3659, 3671, 3727, 3769, 3863, 3947, 4217, 4327, 4373, 4391 (list; graph; listen)
OFFSET

1,1

COMMENT

Call the numbers in A008849 F-numbers; then a prime p is called an F-prime if there exists a squarefree F-number q_1*q_2*...*q_r*p with q_1 < q_2 < ... < q_r < p in which the q_i's are primes but not F-primes.

REFERENCES

I. Kaplansky, The challenges of Fermat, Wallis and Ozanam (and several related challenges): I. Fermat's first challenge, Preprint, 2002.

CROSSREFS

Cf. A008849.

Sequence in context: A009219 A142185 A158914 this_sequence A152988 A009202 A093112

Adjacent sequences: A046869 A046870 A046871 this_sequence A046873 A046874 A046875

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 05 2002

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research