|
%I #8 Jan 02 2021 08:36:13
%S 1,2,7,1,2,5,1,0,0,0,1,0,6,4,8,1,0,3,8,2,3,1,0,0,0,0,0,0,1,0,0,7,7,6,
%T 9,6,1,0,0,5,4,4,6,2,5,1,0,0,0,0,0,0,0,0,0,1,0,0,0,7,8,7,3,8,7,5,1,0,
%U 0,0,2,6,5,7,7,2,8,8,1,0,0,0,0,0,0,0,0,0,0,0,0,1
%N Constant whose decimal expansion is the concatenation of the smallest n-digit cube A061434(n), for n = 1, 2, 3, ...
%C Every third smallest n-digit cube (i.e., for n = 3k + 1, k >= 0) is 10^k, which explains the chunks of (1,0,...,0), cf. formula.
%C The terms of sequence A215692 converge to this sequence of digits, and to this constant, up to powers of 10.
%F c = 0.12712510001064810382310000001007769610054462510000000001000787387510002657...
%F = Sum_{k >= 1} 10^(-k(k+1)/2)*ceiling(10^((k-1)/3))^2
%F a(-n(n+1)/2) = 1 for all n >= 2;
%F a(k) = 0 for -3n(3n+1)/2 > k > -(3n+1)(3n+2)/2, n >= 0.
%e The smallest cube with 1, 2, 3, 4, ... digits is, respectively, 1, 27 = 3^3, 125 = 5^3, 1000 = 10^3, .... Here we list the sequence of digits of these numbers: 1; 2, 7; 1, 2, 5; 1, 0, 0, 0; ...
%e This can be considered, as for the Champernowne and Copeland-Erdős constants, as the decimal expansion of a real constant 0.1271251000106481...
%o (PARI) concat([digits(ceil(10^((k-1)/3))^3)|k<-[1..14]]) \\ as seq. of digits
%o c(N=12)=sum(k=1,N,.1^(k*(k+1)/2)*ceil(10^((k-1)/2))^2) \\ as constant
%Y Cf. A061434 (smallest n-digit cube), A215692 (has this as "limit"), A340209 (same with largest n-digit cubes, limit of A340115), A340206 (same for squares, limit of A215689), A340219 (same for primes, limit of A215641), A340221 (same for semiprimes, limit of A215647).
%Y Cf. A033307 (Champernowne constant), A030190 (binary), A001191 (concatenation of all squares), A134724 (cubes), A033308 (primes: Copeland-Erdős constant).
%K nonn,base,cons
%O 0,2
%A _M. F. Hasler_, Dec 31 2020
|
