A109690 - OEIS

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

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”).

Other ways to Give

A109690

Smallest 4th power that contains exactly n occurrences of the string n.

2

1, 1, 234256, 33362176, 4640470641, 5035553952016, 4396167663616, 4777933277779216, 3588188855118837841, 999395939249909776

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

a(11) = 329907785371111117252064111115111841, assuming occurrences can overlap (cf. A109689). - Michael S. Branicky, Dec 21 2020

LINKS

Table of n, a(n) for n=0..9.

EXAMPLE

a(2)=234256 since this is the first 4th power that contains exactly two 2's.

PROG

(Python) # a() in A109691

print([a(n, POW=4) for n in range(10)]) # Michael S. Branicky, Dec 21 2020

CROSSREFS

Cf. A109689 (cubes), A109691 (5th powers).

Sequence in context: A250858 A233902 A202938 * A013905 A353634 A237239

Adjacent sequences: A109687 A109688 A109689 * A109691 A109692 A109693

KEYWORD

base,more,nonn

AUTHOR

Erich Friedman, Aug 07 2005

STATUS

approved