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.

A306632 Numbers n which are both lucky (A000959) and Lucas (A000032).

Original entry on oeis.org

1, 3, 7, 3571, 9349, 710647, 12752043
Offset: 1

Views

Author

Amiram Eldar, Mar 02 2019

Keywords

Comments

No more terms below 10^9.
Calculated using Hugo van der Sanden's Lucky numbers up to 10^9.

Crossrefs

Programs

  • Mathematica
    m = 10^4; L = Table[2*i + 1, {i, 0, m}]; For[n = 2, n < Length[L], r = L[[n++]]; L = ReplacePart[L, Table[r*i -> Nothing, {i, 1, Length[L]/r}]]]; lucas = {}; n = 1; While[(l = LucasL[n]) < m, AppendTo[lucas, l]; n++]; Intersection[L, lucas] (* after Jean-François Alcover at A000959 *)
  • Perl
    use ntheory ':all'; for (1..35) { my $n = lucasv(1, -1, $); print "$n\n" if is_lucky($n) } # _Daniel Suteu, Mar 02 2019