The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A126624 Simili-primes of order 9. 2

%I #21 Apr 09 2023 02:15:46

%S 10,19,29,41,51,63,73,85,97,108,121,134,144,158,169,182,193,207,221,

%T 233,244,258,272,282,297,309,325,336,349,362,376,391,403,416,428,445,

%U 457,471,483,499,514,526,539,553,565,578,593,606,623,635,647

%N Simili-primes of order 9.

%C Invented by _Hugo van der Sanden_ and _Eric Angelini_, computed by Mensanator.

%D J.-P. Delahaye, La suite du lézard et autres inventions, Pour la Science, No. 353, 2007.

%H Alois P. Heinz, <a href="/A126624/b126624.txt">Table of n, a(n) for n = 1..10000</a> (first 150 terms from a correspondent using the pseudonym "Mensanator")

%H Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/ThousandZetas.htm">Thousand Zetas</a>

%H Eric Angelini, <a href="/A123929/a123929.html">Thousand Zetas</a> [Cached copy, with permission]

%o (PARI) A126624(n, mode=0/*+1=print, +2=return list*/, N=9, P=List(N+1))={ while(n--, my(k=P[#P]); bittest(mode, 0)&&print1(k", "); for(i=1, N, while(k++, for(j=1, #P, k%P[j]||next(2)); break)); listput(P, k)); if(bittest(mode, 1), Vec(P), P[#P])} \\ _M. F. Hasler_, Dec 24 2013

%Y See A123929 for further details.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Feb 09 2007

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 May 14 00:47 EDT 2024. Contains 372528 sequences. (Running on oeis4.)