|
%I #28 Oct 09 2019 08:10:59
%S 0,24,100,624,1000,10001,10000,100001,100000,1000001,1000000,10000001,
%T 10000000,100000001,100000000,1000000001,1000000000,10000000001,
%U 10000000000
%N a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 0's.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PronicNumber.html">Pronic Number</a>
%e From _Jesse Sealand_, Oct 05 2019: (Start)
%e a(1) = 0 since A002378(0) = 0;
%e a(2) = 24 since A002378(24) = 600;
%e a(3) = 100 since A002378(100) = 10100;
%e a(4) = 624 since A002378(624) = 390000, etc.
%e (End).
%t a[n_] := Block[{a = 0}, While[Count[IntegerDigits[a*(a + 1)], 0] != n, ++a]; Return[a]]; a /@ Range[1, 10] (* _Julien Kluge_, Dec 15 2016 *)
%Y Cf. A002378, A048530.
%Y Cf. A048531, A048533, A048535, A048537, A048539, A048541, A048543, A048545, A048547.
%K nonn,base,more
%O 1,2
%A _Patrick De Geest_, May 15 1999
%E a(16)-a(19) from _Lars Blomberg_, Jun 10 2011
%E Name edited by _Jesse Sealand_, Oct 05 2019
|
