Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077436
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077436 Let B(n) be the sum of binary digits of n. This sequence contains n such that B(n)=B(n^2). +0
12
1, 2, 3, 4, 6, 7, 8, 12, 14, 15, 16, 24, 28, 30, 31, 32, 48, 56, 60, 62, 63, 64, 79, 91, 96, 112, 120, 124, 126, 127, 128, 157, 158, 159, 182, 183, 187, 192, 224, 240, 248, 252, 254, 255, 256, 279, 287, 314, 316, 317, 318, 319, 351, 364 (list; graph; listen)
OFFSET

1,2

COMMENT

Superset of A023758.

A159918(a(n)) = A000120(a(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 25 2009]

LINKS

G. Melfi, On simultaneous binary expansions of n and n^2.

EXAMPLE

The element 79 belongs to the sequence because 79=(1001111) and 79^2=(1100001100001), so B(79)=B(79^2)

MATHEMATICA

Do[If[DigitCount[n, 2, 1] != DigitCount[n^2, 2, 1], x, Print[n]], {n, 1, 364}]

CROSSREFS

A058369. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 25 2009]

Sequence in context: A032900 A166935 A114391 this_sequence A082752 A023758 A054784

Adjacent sequences: A077433 A077434 A077435 this_sequence A077437 A077438 A077439

KEYWORD

easy,nonn

AUTHOR

Giuseppe Melfi (Giuseppe.Melfi(AT)unine.ch), Nov 30 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research