The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036523 Smallest triangular number containing exactly n 6's. 1
 6, 66, 666, 66066, 5666661, 36666766, 646686666, 77666666626, 4666660668676, 66488766666666, 6666063656661696, 6666664664655666, 666416695266666666, 56666136666666763866, 626646696666896766666, 11666966196628666666666, 66666666636866637006666, 2626660686666666671166666 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..18. 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 *) CROSSREFS Cf. A048361, A036517-A036526. Sequence in context: A068643 A119053 A119089 * A112902 A119160 A119210 Adjacent sequences: A036520 A036521 A036522 * A036524 A036525 A036526 KEYWORD nonn,base AUTHOR David W. Wilson EXTENSIONS a(13)-a(18) from Giovanni Resta, Oct 30 2019 STATUS approved

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

Last modified September 22 07:58 EDT 2023. Contains 365519 sequences. (Running on oeis4.)