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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089998 Smallest square with Hamming weight n (i.e. with exactly n 1's when written in binary). 3
0, 1, 9, 25, 169, 121, 441, 1521, 2025, 5625, 24025, 47089, 109561, 32761, 393129, 851929, 1540081, 6275025, 15327225, 27258841, 41925625, 127893481, 243204025, 385611769, 998244025, 1979449081, 4823441401, 12870221809, 34324602361 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

A000120(a(n)) = n.

MATHEMATICA

a = Table[0, {30}]; Do[c = Count[IntegerDigits[n^2, 2], 1]; If[ a[[c + 1]] == 0, a[[c + 1]] = n^2; Print[c, " = ", n^2]], {n, 1, 360000}] (from Robert G. Wilson v Dec 03 2003)

CROSSREFS

Cf. A000290, A089999, A061712, A090001.

Sequence in context: A146373 A084605 A098773 * A014728 A018929 A051515

Adjacent sequences:  A089995 A089996 A089997 * A089999 A090000 A090001

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 20 2003

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 03 2003

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.