|
Search: id:A061093
|
|
|
| A061093 |
|
Let k = n-th number that is a possible digit-sum for a square (A056991); sequence gives smallest square with digit-sum k. |
|
+0
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
Amarnath Murthy, Fabricating a perfect square with a given valid digit sum. Smarandache Notions Journal, Vol. 11, No. 1-2-3, Spring 2000.
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
EXAMPLE
|
a(8) =576, sum of digits = 18, the eighth term of A056991 (1,4,7,9,10,13,16,18...)
|
|
CROSSREFS
|
Sequence in context: A110651 A115054 A049208 this_sequence A067178 A029659 A072652
Adjacent sequences: A061090 A061091 A061092 this_sequence A061094 A061095 A061096
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 19 2001
|
|
|
Search completed in 0.002 seconds
|
