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.

A036530 Smallest cube containing exactly n 3's.

Original entry on oeis.org

0, 4913, 343, 5735339, 108531333, 353393243, 333533450375, 3707322336333, 86333306433373, 153712433903333733, 333343033492332032, 8343304933332333329, 433134325352337333353, 33435346723033333302433, 243513939323833732333333, 33393753313938361233336383
Offset: 0

Views

Author

Keywords

Comments

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

Crossrefs

Programs

  • Mathematica
    Table[SelectFirst[Range[2100000]^3,DigitCount[#,10,3]==n&],{n,11}] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Oct 24 2015 *)

Formula

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

Extensions

a(0) = 0 prefixed by M. F. Hasler, Feb 21 2016
a(12)-a(15) from Giovanni Resta, Jun 29 2018