login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046872 F-primes. 1

%I #4 Mar 30 2012 16:48:23

%S 7,47,191,239,307,463,499,701,743,787,853,1087,1123,1301,1487,1553,

%T 1567,1823,2309,2621,2843,2903,3083,3203,3319,3323,3359,3373,3541,

%U 3583,3557,3617,3659,3671,3727,3769,3863,3947,4217,4327,4373,4391

%N F-primes.

%C 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.

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

%Y Cf. A008849.

%K nonn,nice

%O 1,1

%A _N. J. A. Sloane_, Oct 05 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)