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.

Previous Showing 31-33 of 33 results.

A345447 Numbers of the form i+j+2*i*j and 2+i+j+2*i*j for i,j >= 1.

Original entry on oeis.org

4, 6, 7, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 54, 55, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80
Offset: 1

Views

Author

Davide Rotondo, Jun 19 2021

Keywords

Comments

Except for 1 and 2 the complement sequence c is: 3, 5, 8, 11, 20, 23, 35, 41, 50, 53, 56, 65, ...; where 2*c(i) + 1 and 2*c(i) - 3 are a pair of cousin primes. This is a consequence of the sieve of Sundaram.

Examples

			For i,j = 1, 1+1+2*1*1 = 4 and 2+1+1+2*1*1 = 6.
		

Crossrefs

Union of A047845 and A153043, except for 0 and 2.

Programs

  • Python
    def aupto(limit):
        aset = set()
        for i in range(1, limit//3):
            for j in range(i, limit//3):
                t = i + j + 2*i*j
                if t > limit: break
                aset.update([t, t+2])
        return sorted(an for an in aset if an <= limit)
    print(aupto(80)) # Michael S. Branicky, Jul 05 2021

A367647 Irregular triangle read by rows in which row n lists the positive values k such that there are no primes between k*n and k*(n + 1), or -1 if no such k exists.

Original entry on oeis.org

1, 1, 2, 1, 4, 2, 1, 3, 4, 1, 2, 3, 2, 4, 2, 9, 1, 1, 6, 2, 3, 2, 7, 3, 5, 2, 6, 1, 6, 7, 10, 1, 3, 4, 2, 4, 5, 1, 2, 5, 1, 2, 3, 8, 1, 7, 1, 2, 2, 3, 5, 4, 7, 11, 3, 4, 2, 3, 1, 2, 10, 1, 4, 9, 1, 2, 6, 1, 4, 15, 4, 6, 2, 5, 8, 1, 2, 3, 4, 1, 3, 2, 3, 5, 8, 3, 5, 2, 4, 7, 2, 5, 1, 3, 12, 1, 2, 2, 4, 7
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Nov 25 2023

Keywords

Examples

			Triangle begins:
1;
1;
1;
2;
1;
4;
2;
1, 3, 4;
1;
2;
3;
2, 4;
2, 9;
1;
1, 6;
2, 3;
2, 7;
3, 5;
2, 6;
1, 6, 7, 10;
1, 3, 4;
2;
4, 5;
1, 2, 5;
1, 2, 3, 8.
		

Crossrefs

A380831 Numbers k such that k^(k + 1) == k + 1 (mod 2*k + 1) while 2*k+1 is not prime.

Original entry on oeis.org

1023, 1638, 14670, 21399, 24570, 40290, 44178, 45375, 52326, 98046, 128499, 135975, 157410, 229494, 244998, 257223, 370875, 400302, 419430, 436590, 458163, 502326, 625974, 686826, 754854, 839270, 905786, 993510, 1102983, 1134546, 1142226, 1152083, 1193898, 1373238, 1374011
Offset: 1

Views

Author

Michel Marcus, Feb 05 2025

Keywords

Crossrefs

Intersection of A374913 and A047845.

Programs

  • PARI
    isok(k) = (!isprime(2*k+1)) && (Mod(k, 2*k+1)^(k+1) == k+1);
Previous Showing 31-33 of 33 results.