Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125121
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125121 Sturdy numbers: n such that in binary notation k*n has at least as many 1-bits as n for all k>0. +0
8
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 17, 18, 20, 21, 24, 28, 30, 31, 32, 33, 34, 35, 36, 40, 42, 45, 48, 49, 51, 56, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 73, 75, 80, 84, 85, 89, 90, 93, 96, 98, 102, 105, 112, 120, 124, 126, 127, 128, 129, 130, 132, 133, 135, 136 (list; graph; listen)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..2475 (sturdy numbers <= 2^16)

K. B. Stolarsky, Integers whose multiples have anomalous digital frequencies, Acta Arithmetica, 38 (1980), 117-128.

FORMULA

Complement of A005360. - T. D. Noe (noe(AT)sspectra.com), Jul 17 2008

CROSSREFS

See A143027 for prime sturdy numbers.

Sequence in context: A164707 A057890 A161604 this_sequence A136490 A129523 A164713

Adjacent sequences: A125118 A125119 A125120 this_sequence A125122 A125123 A125124

KEYWORD

nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 07 2008

EXTENSIONS

Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Jul 17 2008

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research