A323604 Smallest m such that each digit (0-9) appears exactly n times in the concatenation of m and pi(m).

102756, 10013236879, 1000112354597667

Offset

1,1

Links

Table of n, a(n) for n=1..3.

Carlos Rivera, Problem 71: n & pi(n) such that ..., The Prime Puzzles & Problems Connection.

Example

a(2) = 10013236879 because each digit (0-9) appears exactly 2 times in the equation pi(10013236879) = 455627894 and this is the smallest case.

Crossrefs

Cf. A000040, A000720, A050278, A322828.

Sequence in context: A146569 A081463 A321149 * A014884 A015330 A250704

Adjacent sequences: A323601 A323602 A323603 * A323605 A323606 A323607

Keyword

nonn,base,hard,bref,more

Author

G. L. Honaker, Jr., Jan 19 2019

Status

approved