cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A050662 a(n) is smallest number such that number of primes produced according to rules stipulated in Honaker's A048853 is n.

Original entry on oeis.org

90, 20, 2, 1, 29, 23, 11, 13, 117, 101, 107, 387, 177, 357, 1001, 4221, 10759, 11487, 42497, 42189, 317721, 984417, 344253, 1851759, 14040341, 15848679, 125367697, 139367847, 1044394659, 2214409197, 2909053719, 14485875423, 1167555543, 111738007953
Offset: 1

Views

Author

Patrick De Geest, Jul 15 1999

Keywords

Comments

a(32) > 10^10. a(33) = 1167555543. a(34) > 10^10. - Donovan Johnson, May 08 2010
a(35) > 3*10^11. - Oscar Volpatti, Aug 06 2020

Crossrefs

Cf. A048853, first terms of A050652-A050661, A050673.

Programs

  • Maple
    A048853 := proc(n::integer) local resul,ddigs,d,c,tmp ; resul := 0 ; ddigs := convert(n,base,10) ; for d from 1 to nops(ddigs) do for c from 0 to 9 do if c = 0 and d = nops(ddigs) then continue ; else if c <> op(d,ddigs) then tmp := [op(1..d-1,ddigs),c,op(d+1..nops(ddigs),ddigs)] ; tst := sum(op(i,tmp)*10^(i-1),i=1..nops(tmp)) ; if isprime(tst) then resul := resul+1 ; fi ; fi ; fi ; od : od ; RETURN(resul) ; end: A050662 := proc(n::integer) local i; for i from 1 to 10000000 do if A048853(i) = n then RETURN(i) ; fi ; od ; RETURN(-1) ; end : for n from 1 to 90 do print(A050662(n)) ; od ; # R. J. Mathar, Apr 25 2006

Extensions

a(25)-a(31) and a(33) from Donovan Johnson, May 08 2010
a(32) and a(34) from Oscar Volpatti, Aug 06 2020