The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036533 Smallest cube containing exactly n 6's. 7

%I

%S 0,64,166375,46656,367061696,1676676672,66676466375,2646396666368,

%T 6666963601661,6946660616126616,3666676156163166167,

%U 62656677666653866496,2674826866666660366016,166465666639716668628669,3656365366626065666266624,167947668303666616666566656

%N Smallest cube containing exactly n 6's.

%C a(n)^(1/3) = A048371(n) is the index of the first occurrence of n in sequence A269246. - _M. F. Hasler_, Feb 21 2016

%H Giovanni Resta, <a href="/A036533/b036533.txt">Table of n, a(n) for n = 0..23</a>

%F a(n) = A048371(n)^3. - _M. F. Hasler_, Feb 21 2016

%t nsmall = Table[Infinity, 20];

%t For[i = 0, i <= 10^6, i++, n0 = Count[IntegerDigits[i^3], 6];

%t If[nsmall[[n0 + 1]] > i^3, nsmall[[n0 + 1]] = i^3]];

%t Cases[nsmall, _?NumberQ] (* _Robert Price_, Mar 21 2020 *)

%Y Cf. A048371, A036527 - A036536 for other digits 0 - 9.

%Y Analog for squares: A036510 = A048348^2.

%K nonn,base

%O 0,2

%A _David W. Wilson_

%E Extended with a(0) = 0 by _M. F. Hasler_, Feb 21 2016

%E a(11)-a(15) from _Giovanni Resta_, Jun 29 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 03:20 EST 2020. Contains 338632 sequences. (Running on oeis4.)