|
Search: id:A061099
|
|
|
| A061099 |
|
Perfect squares with final digit sum = 1. |
|
+0
1
|
|
| 1, 64, 100, 289, 361, 676, 784, 1225, 1369, 1936, 2116, 2809, 3025, 3844, 4096, 5041, 5329, 6400, 6724, 7921, 8281, 9604, 10000, 11449, 11881, 13456, 13924, 15625, 16129, 17956, 18496, 20449, 21025, 23104, 23716, 25921, 26569, 28900, 29584
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
Amarnath Murthy, Fabricating a perfect square with a given valid digit sum (to be published)
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
EXAMPLE
|
289= 17^2, 2+8+9 = 19, 1+9 =1, 1369=37^2, 1+3+6+9 = 19, 1+9 =1
|
|
PROGRAM
|
(PARI) { b=0; for (n=0, 1000, until (s==1, b++; s=b^2; s-=9*(s\9)); write("b061099.txt", n, " ", b^2) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 19 2009]
(PARI) SumD(x)= { s=0; while (x>9, s=s+x-10*(x\10); x=x\10); return(s + x) } { b=0; for (n=0, 1000, s=2; while (s!= 1, b++; s=b^2; while (s>9, s=SumD(s))); write("b061099.txt", n, " ", b^2) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 17 2009]
|
|
CROSSREFS
|
A056991.
Sequence in context: A036330 A046306 A104022 this_sequence A118488 A088033 A039481
Adjacent sequences: A061096 A061097 A061098 this_sequence A061100 A061101 A061102
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 19 2001
|
|
EXTENSIONS
|
More terms from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 17 2009
|
|
|
Search completed in 0.002 seconds
|
