login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A109689
Smallest cube that contains exactly n occurrences of the string n.
2
1, 1, 21952, 5735339, 4410944, 3553559576, 66676466375, 7707245470777, 148388768680888, 999970000299999, 310810243810243102106210518101010107767, 1115341111117511141118670443456
OFFSET
0,3
COMMENTS
10^32 < a(10) <= 101010101010100310108799210878085984030872. - Donovan Johnson, Jan 16 2013
For a(11), I assumed the occurrences could overlap. a(12) <= 1271462121212121201236561213010121209124112392. - Giovanni Resta, Feb 09 2013
EXAMPLE
a(2) = 21952 since this is the first cube that contains exactly two 2's.
PROG
(Python) # a() in A109691
print([a(n, POW=3) for n in range(10)]) # Michael S. Branicky, Dec 21 2020
CROSSREFS
Cf. A109690 (4th powers), A109691 (5th powers).
Sequence in context: A066693 A262821 A250569 * A209733 A203441 A217533
KEYWORD
base,more,nonn
AUTHOR
Erich Friedman, Aug 07 2005
EXTENSIONS
a(10) from Giovanni Resta, Jan 21 2013
a(11) from Giovanni Resta, Feb 09 2013
STATUS
approved