login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087095 a(n) = A077503(n) - n*10^d, where d = n-A055642(n), A055642(n) = number of digits in n. 1

%I #15 Jun 23 2019 16:59:14

%S 0,5,24,96,176,625,1316,13025,0,14129,24161,580921,1310976,4588964,

%T 7007601,0,233634401,244436761,2180575376,3762025,23492302009,

%U 71829444801,293908889924,357018382249,2562501107225,2194311769649

%N a(n) = A077503(n) - n*10^d, where d = n-A055642(n), A055642(n) = number of digits in n.

%F a(n) = ceiling(sqrt(n*10^d))^2 - n*10^d, where d = n-digit(n), digit(n) = number of digits in n.

%e a(7) = 7001316 - 7000000 = 1316.

%t ceil[n_]:=Module[{d=n-IntegerLength[n],c},c=n*10^d;Ceiling[Sqrt[c]]^2-c]; Array[ceil,30] (* _Harvey P. Dale_, Sep 03 2018 *)

%Y Cf. A055642, A077503.

%K nonn,base

%O 1,2

%A _Ray Chandler_, Aug 11 2003

%E Edited by _Charles R Greathouse IV_, Aug 03 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:13 EDT 2024. Contains 371905 sequences. (Running on oeis4.)