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.

A036523 Smallest triangular number containing exactly n 6's.

Original entry on oeis.org

6, 66, 666, 66066, 5666661, 36666766, 646686666, 77666666626, 4666660668676, 66488766666666, 6666063656661696, 6666664664655666, 666416695266666666, 56666136666666763866, 626646696666896766666, 11666966196628666666666, 66666666636866637006666, 2626660686666666671166666
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    nsmall = Table[Infinity, 20];
    For[i = 0, i <= 10^6, i++, p = PolygonalNumber[i];
      n0 = Count[IntegerDigits[p], 6];
      If[nsmall[[n0]] > p, nsmall[[n0]] = p]];
    ReplaceAll[nsmall, Infinity -> "?"] (* Robert Price, Mar 22 2020 *)

Extensions

a(13)-a(18) from Giovanni Resta, Oct 30 2019