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.

A074824 Numbers k such that 2^k + Fibonacci(k) is prime.

Original entry on oeis.org

1, 2, 4, 5, 8, 11, 16, 19, 44, 88, 224, 349, 520, 1187, 2044, 2636, 2645, 3994, 6851, 12016, 16304, 31388, 54296, 56608, 100700, 134387
Offset: 1

Views

Author

Robert G. Wilson v, Sep 06 2002

Keywords

Comments

2^(3n) + Fibonacci(3n) is even if n>0.

Crossrefs

Programs

  • Mathematica
    Do[ If[ PrimeQ[ 2^n + Fibonacci[n]], Print[n]], {n, 1, 5000}]
  • PARI
    is(n)=ispseudoprime(fibonacci(n)+2^n) \\ Charles R Greathouse IV, May 22 2017

Extensions

a(19)-a(21) from Ryan Propper, Aug 30 2005
a(22) from Amiram Eldar, May 10 2022
a(23)-a(24) from Michael S. Branicky, May 15 2023
a(25)-a(26) from Michael S. Branicky, Oct 23 2024

A292614 Numbers k such that 2^k - Lucas(k) is prime.

Original entry on oeis.org

14, 19, 25, 41, 46, 65, 136, 145, 185, 193, 290, 406, 481, 641, 761, 3481, 4873, 5360, 6682, 13579, 34120, 35384, 43070, 46744, 96014, 212521
Offset: 1

Views

Author

Amiram Eldar, Sep 20 2017

Keywords

Comments

a(26) > 139000. - Giovanni Resta, Sep 21 2017

Crossrefs

Programs

  • Mathematica
    Select[Range[0, 6000], PrimeQ[2^# - LucasL[#]] &]

Extensions

a(24)-a(25) from Giovanni Resta, Sep 21 2017
a(26) from Michael S. Branicky, Apr 25 2025
Showing 1-2 of 2 results.