[go: up one dir, main page]

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

A376078
The smallest number whose prime factor concatenation when written in all bases k, where k = 2...n, contains all digits 0,1,...,(k-1).
0
2, 6, 38, 190, 5662, 39255, 1206042, 22481939, 392228153, 6329975006
OFFSET
2,1
COMMENTS
Up to a(11) all terms have prime factors whose concatenation length in base n is n, the minimum possible value. Is this true for all a(n)?
EXAMPLE
a(7) = 39255 as 39255 = 3*5*2617 = 11_2*101_2*101000111001_2 = "11101101000111001" which contains all digits 0...1 = 10_3*12_3*10120221_3 = "101210120221" which contains all digits 0...2, 3_4*11_4*220321_4 = "311220321" which contains all digits 0...3 = 3_5*10_5*40432_5 = "31040432" which contains all digits 0...4 = 3_6*5_6*20041_6 = "3520041" which contains all digits 0...5 = 3_7*5_7*10426_7 = "3510426" which contains all digits 0...6.
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Scott R. Shannon, Sep 09 2024
STATUS
approved