|
| |
|
|
A062893
|
|
Number of squares that can be obtained by using some or all of the digits of n.
|
|
0
| |
|
|
1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 2, 0, 1, 2, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0, 1, 2, 2, 1, 1, 3, 1, 1, 1, 1, 1, 3, 2, 2, 2, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,11
|
|
|
EXAMPLE
| a(169) = 6 the squares obtained by using the digits are 1,9,16, 169, 196, 961.
|
|
|
CROSSREFS
| Sequence in context: A124766 A103765 A125029 * A158210 A087802 A079553
Adjacent sequences: A062890 A062891 A062892 * A062894 A062895 A062896
|
|
|
KEYWORD
| base,nonn,easy
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 29 2001
|
|
|
EXTENSIONS
| Corrected and extended by Larry Reeves (larryr(AT)acm.org) and Dean Hickerson (dean.hickerson(AT)yahoo.com), Jul 02 2001
|
| |
|
|
