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-3 of 3 results.

A095062 Number of fib00 primes (A095082) in range [2^n,2^(n+1)].

Original entry on oeis.org

1, 1, 2, 1, 2, 7, 12, 14, 27, 50, 91, 178, 335, 611, 1156, 2147, 4042, 7831, 14724, 28227, 53736, 102482, 196303, 376121, 723408, 1393572, 2683465, 5180304, 10009707, 19366479, 37509260, 72706948, 141074303, 273975483, 532538340
Offset: 1

Views

Author

Antti Karttunen, Jun 01 2004

Keywords

Crossrefs

Formula

a(n) = A095060(n) - A095067(n) = A095065(n) + A095068(n).

Extensions

a(34)-a(35) from Amiram Eldar, Jun 13 2024

A095065 Number of fib000 primes (A095085) in range ]2^n,2^(n+1)].

Original entry on oeis.org

0, 1, 1, 1, 1, 4, 9, 6, 19, 28, 54, 109, 210, 373, 707, 1316, 2497, 4827, 9127, 17467, 33212, 63161, 121404, 232455, 446846, 860466, 1658020, 3200462, 6184814, 11971998, 23184215, 44934259, 87179855, 169330402, 329113635
Offset: 1

Views

Author

Antti Karttunen, Jun 01 2004

Keywords

Crossrefs

Formula

a(n) = A095062(n) - A095068(n).

Extensions

a(34)-a(35) from Amiram Eldar, Jun 13 2024

A095088 Fib100 primes, i.e., primes p whose Zeckendorf-expansion A014417(p) ends with one and two final zeros.

Original entry on oeis.org

3, 11, 37, 71, 79, 113, 139, 181, 223, 257, 283, 359, 367, 401, 409, 443, 503, 571, 587, 613, 647, 757, 859, 977, 1019, 1087, 1163, 1181, 1223, 1231, 1291, 1307, 1367, 1409, 1451, 1511, 1553, 1579, 1613, 1621, 1663, 1697, 1723, 1867, 1901
Offset: 1

Views

Author

Antti Karttunen, Jun 01 2004

Keywords

Crossrefs

Intersection of A000040 and A035337. Cf. A095068.

Programs

  • Python
    from sympy import fibonacci, primerange
    def a(n):
        k=0
        x=0
        while n>0:
            k=0
            while fibonacci(k)<=n: k+=1
            x+=10**(k - 3)
            n-=fibonacci(k - 1)
        return x
    def ok(n): return str(a(n)).endswith("100")
    print([n for n in primerange(1, 2001) if ok(n)]) # Indranil Ghosh, Jun 08 2017
Showing 1-3 of 3 results.