login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066564 Numbers that when incremented by the sum of their digits produce a square. 5
0, 2, 8, 17, 27, 38, 72, 86, 135, 161, 179, 216, 245, 275, 315, 347, 432, 467, 521, 558, 614, 662, 720, 770, 830, 882, 944, 998, 1016, 1080, 1145, 1220, 1278, 1355, 1433, 1512, 1583, 1664, 1746, 1829, 1922, 1998, 2016, 2111, 2189, 2286, 2384, 2483, 2583 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Indranil Ghosh, Table of n, a(n) for n = 1..11130 (terms 1..1000 from Harry J. Smith)

EXAMPLE

179 is in the sequence because 179 + sum of digits of 179 = 179 + 17 = 196 which is a perfect square. - Indranil Ghosh, Feb 10 2017

MATHEMATICA

Select[Range[0, 2600], IntegerQ[Sqrt[#+Total[IntegerDigits[#]]]]&] (* Harvey P. Dale, May 19 2012 *)

PROG

(PARI): digitsum(n) = local(s, d); s = 0; while(n>0, d = divrem(n, 10); n = d[1]; s = s+d[2]); s a066564(m) = local(n); for(n = 0, m, if(issquare(n+digitsum(n)), print1(n, ", "))) a066564(10000)

(PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { n=0; for (m=0, 10^10, if (issquare(m + SumD(m)), write("b066564.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Mar 04 2010

(PARI) isok(n) = issquare(n + sumdigits(n)); \\ Michel Marcus, Jan 15 2016

(MAGMA) [n: n in [0..3*10^3] | IsSquare(&+Intseq(n)+n)]; // Vincenzo Librandi, Jan 15 2016

CROSSREFS

Cf. A066566.

Sequence in context: A217192 A224865 A192159 * A034972 A061150 A160189

Adjacent sequences:  A066561 A066562 A066563 * A066565 A066566 A066567

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Dec 18 2001

EXTENSIONS

More terms from Jason Earls (zevi_35711(AT)yahoo.com), Dec 20 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified March 27 04:08 EDT 2017. Contains 284144 sequences.