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

A135216
a(n)= number of numbers with n+1 digits and without zero digits whose squares have maximal number of zero digits = A135215(n+1).
2
18, 3, 13, 1, 7, 1
OFFSET
1,1
EXAMPLE
a(1)=18 because we have 18 numbers with 2 digits and without zero digit whose square have maximal possible value 1 zero: 32, 33, 45, 47, 48, 49, 51, 52, 53, 55, 64, 71, 78, 84, 95, 97, 98, 99.
a(2)=3 because we have 3 numbers with 3 digits and without zero digit whose square have maximal possible value 3 zeros: 448, 548, 949.
a(3)=13 because we have 13 numbers with 4 digits and without zero digit whose square have maximal possible value 4 zeros: 3747, 3751, 4899, 6245, 6249, 6253, 7746, 7747, 7749, 7751, 7753, 9747, 9798.
a(4)=1 because we have only one number with 5 digits and without zero digit whose square have maximal possible value 6 zeros: 62498.
a(5)=7 because we have 7 numbers with 6 digits and without zero digit whose square have maximal possible value 7 zeros: 248998, 316245, 489898, 498999, 781249, 948951, 997998.
a(6)=1 because we have only one number with 7 digits and without zero digit whose square have maximal possible value 10 zeros: 6244998.
MATHEMATICA
(*For a(7) *) c = 0; mx = 10; Do[Do[Do[Do[Do[Do[Do[k = 10^6b + 10^5q + 10^4r + 10^3p + 10^2s + 10n + m; w = IntegerDigits[k^2]; ile = 0; Do[If[w[[t]] == 0, ile = ile + 1], {t, 1, Length[w]}]; If[ile == mx, c = c + 1], {m, 1, 9}], {n, 1, 9}], {s, 1, 9}], {p, 1, 9}], {r, 1, 9}], {q, 1, 9}], {b, 1, 9}]; c (*Artur Jasinski*)
KEYWORD
nonn,base
AUTHOR
Artur Jasinski, Nov 23 2007
STATUS
approved