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.

Showing 1-2 of 2 results.

A156115 The 3677th prime century apportioned with exactly one prime in each of its ten decades.

Original entry on oeis.org

367603, 367613, 367621, 367637, 367649, 367651, 367663, 367673, 367687, 367699
Offset: 1

Views

Author

Ki Punches, Feb 15 2009

Keywords

Comments

Other sequences with 10 consecutive primes of this type of restricted gaps start at 1644607, 2214907, 2465909, 5714309, 8451407, 8468401 etc., so 367603 is not the only example. Their associated centuries 16447, 22150, 24660, 57144 etc. are put into A103608 iff they are prime. [From R. J. Mathar, Feb 20 2009, Mar 01 2009]

A307890 Prime centuries with at least one prime year in each decade and exactly one prime year in decades 1 to 8.

Original entry on oeis.org

3677, 4073, 16447, 118463, 211217, 357131, 368153, 582017, 932413, 1172777, 1239443, 2284027, 2421473, 3900931, 4943777, 5046053, 6850463, 6966059, 8046347, 10448783, 11548777, 12849937, 15198811, 16031237, 17315087, 19443679, 20075687, 20434811, 20462861, 20614667
Offset: 1

Views

Author

Zak Seidov, Feb 27 2009

Keywords

Comments

In other words, prime numbers p such that there are ten consecutive primes between p*100-100 and p*100, each of them in a different decade. (The P-div-10s are all different.) - Don Reble, May 02 2019

Examples

			4073 is in the sequence, representing the prime sequence 407203, 407207, 407219, 407221, 407233, 407249, 407257, 407263, 407273, 407287, 407291, 407299, with 2 primes in decades 0 and 9, and 1 prime in decades 1 to 8. - _R. J. Mathar_, May 03 2019
		

Crossrefs

Cf. A156115, super set of the primes in A103608.

Programs

  • Maple
    isA307890 := proc(n)
        local p, dec ;
        if not isprime(n) then
            false;
        else
            p := 100*(n-1) ;
            p := prevprime(p+10) ;
            for dec from 0 to 9 do
                if modp(floor(p/10), 10) <> dec then
                    return false;
                end if;
                p := nextprime(p) ;
            end do:
            true ;
        end if;
    end proc:
    for i from 1 do
        p := ithprime(i) ;
        if isA307890(p) then
            printf("%d, \n", p) ;
        end if;
    end do: # R. J. Mathar, May 03 2019
Showing 1-2 of 2 results.