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.

Previous Showing 11-11 of 11 results.

A036529 Smallest cube containing exactly n 2's.

Original entry on oeis.org

0, 27, 21952, 2628072, 202262003, 229220928, 22521332224, 21148222722264, 25942222239227, 2272271222935232, 2262268226562252992, 4223937222222326272, 22225347273222227224, 122245292222422449622424, 2732072222242422541222208, 22422524292920620222272827
Offset: 0

Views

Author

Keywords

Comments

a(n)^(1/3) = A048367(n) is the index of the first occurrence of n in sequence A269242. - M. F. Hasler, Feb 21 2016

Crossrefs

Programs

  • Mathematica
    nsmall = Table[Infinity, 20];
    For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 2];
      If[nsmall[[n0 + 1]] > i^3, nsmall[[n0 + 1]] = i^3]];
    Cases[nsmall, ?NumberQ] (* _Robert Price, Mar 20 2020 *)

Formula

a(n) = A048367(n)^3. - M. F. Hasler, Feb 21 2016

Extensions

a(12)-a(15) from Giovanni Resta, Jun 29 2018
Previous Showing 11-11 of 11 results.