[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323604
Smallest m such that each digit (0-9) appears exactly n times in the concatenation of m and pi(m).
0
102756, 10013236879, 1000112354597667
(list; graph; refs; listen; history; text; internal format)
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

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 00:48 EST 2024. Contains 377523 sequences.
License Agreements, Terms of Use, Privacy Policy