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.

A020996 Numbers k such that the sum of the digits of Fibonacci(k) in base 12 is k.

Original entry on oeis.org

0, 1, 5, 13, 14, 89, 96, 123, 221, 387, 419, 550, 648, 749, 866, 892, 1105, 2037
Offset: 1

Views

Author

Keywords

Comments

No more terms < 100000. - Manfred Scheucher, Aug 03 2015

Crossrefs

Cf. A020995 (base 10), A025490 (base 11).

Programs

  • Maple
    filter:= proc(n) convert(convert(combinat:-fibonacci(n),base,12),`+`)=n end proc:
    select(filter, [$1..3000]); # Robert Israel, Aug 03 2015
  • PARI
    isok(n) = vecsum(digits(fibonacci(n), 12)) == n; \\ Michel Marcus, Feb 18 2015

Extensions

a(1)=0 inserted by Sean A. Irvine, May 06 2019

A025491 In base 11, a(n) = sum of digits of Lucas(a(n)).

Original entry on oeis.org

1, 12, 18, 19, 79, 132, 161, 179, 199, 239, 318, 461, 619, 672, 779, 959, 1098, 1381, 1499, 1559, 1579, 1601, 1621, 1758, 1859, 1901, 1981, 2161, 2179, 2279, 2519, 2819, 2839, 2952, 4019, 4039, 4261, 4499, 4601, 4741, 4859, 5081, 5118, 5141, 5658, 5921
Offset: 1

Views

Author

Keywords

Comments

Searched up to index 7500000. - Sven Simon, Sep 29 2006

Crossrefs

Cf. A025490 (similar, with Fibonacci).
Showing 1-2 of 2 results.