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.

A131341 Number of 0's in maximal Lucas representation (A130311) of n.

Original entry on oeis.org

1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 2, 2, 1, 1, 1, 1, 0, 2, 2, 2, 1, 2, 2, 1, 1, 1, 1, 0, 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 1, 0, 3, 3, 3, 2, 3, 3, 2, 2, 2, 2, 1, 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 1, 0, 4, 4, 3, 3, 3, 3, 2, 3, 3, 3, 2, 3
Offset: 1

Views

Author

Casey Mongoven, Jun 29 2007, corrected Mar 23 2008

Keywords

Crossrefs

Programs

  • Mathematica
    lazy = Select[IntegerDigits[Range[400], 2], SequenceCount[#, {0, 0}] == 0 &]; t = Total[#*Reverse@LucasL[Range[0, Length[#] - 1]]] & /@ lazy; Plus @@@ (1 - lazy[[TakeWhile[Flatten[FirstPosition[t, #] & /@ Range[Max[t]]], NumberQ]]]) (* Amiram Eldar, Jul 05 2025 *)

Extensions

More terms from Amiram Eldar, Jul 05 2025