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.

A020998 Numbers n such that the sum of the digits of Lucas(n) in base 12 is n.

Original entry on oeis.org

1, 7, 165, 227, 278, 322, 323, 385, 414, 433, 439, 634, 860, 964, 1045, 1268
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A020996.

Programs

  • PARI
    isok(n) = vecsum(digits(fibonacci(n+1)+fibonacci(n-1), 12)) == n; \\ Michel Marcus, Feb 18 2015