login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A202082
In base-2 lunar arithmetic, a(n) is the smallest number that has exactly n different square roots (or -1 if no such number exists).
1
1, 111111111, 11111111111, 1011111111111111101, 1111111111111, 10111111111111111, 11100111111111111111111, 101111111111111111101, 111111111111111, 1011111111111111111, 1010111111111111111111101, 1110011111111111111111111, 10111111111111111111101, 11101111111111111111111, 11111111111111111, 1111111111111111111010000, 1111111111111111111111001
OFFSET
1,2
COMMENTS
The numbers are written in base 2.
LINKS
D. Applegate, M. LeBrun and N. J. A. Sloane, Dismal Arithmetic [Note: we have now changed the name from "dismal arithmetic" to "lunar arithmetic" - the old name was too depressing], Journal of Integer Sequences, Vol. 14 (2011), #11.9.8.
EXAMPLE
111111111 has two square roots, 11011 and 11111;
11111111111 has 3 square roots, 110111, 111011, 11111.
CROSSREFS
Sequence in context: A202174 A172525 A038451 * A262499 A068538 A186552
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Dec 13 2011
STATUS
approved