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.

A335721 Integers m such that A014448(m) == 5 (mod m).

Original entry on oeis.org

1, 213, 85887, 974943, 2463831, 3952791, 217643749, 286354743, 874273639, 14029228621
Offset: 1

Views

Author

Chai Wah Wu, Jun 18 2020

Keywords

Comments

Inspired by A335670.
All terms greater than 1 are odd and composite. - Michel Marcus, Jun 19 2020

Crossrefs

Programs

  • Mathematica
    Select[Range[10^5], Divisible[LucasL[3#] - 5, #] &] (* Amiram Eldar, Jun 19 2020 *)
  • PARI
    f(n) = my(w=quadgen(5)); (1+2*w)^n + (3-2*w)^n; \\ A014448
    isok(m) = (m%2) && (m>1) && !isprime(m) && ((f(m) % m) == 5); \\ Michel Marcus, Jun 19 2020

Extensions

a(7)-a(10) from Giovanni Resta, Jun 19 2020