Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037308
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A037308 Numbers n such that (sum of base 2 digits of n) = (sum of base 10 digits of n). +0
12
0, 1, 20, 21, 122, 123, 202, 203, 222, 223, 230, 231, 302, 303, 410, 411, 502, 503, 1130, 1131, 1150, 1151, 1202, 1203, 1212, 1213, 1230, 1231, 1300, 1301, 1402, 1403, 1502, 1503, 1510, 1511, 2006, 2007, 2032, 2033, 2102, 2103 (list; graph; listen)
OFFSET

0,3

EXAMPLE

122 is a member, since digital-sum_2(122)=5=digital-sum_10(122).

PROGRAM

(PARI) for(n=1, 3500, s=ceil(log(n)/log(10)); b=binary(n):l=length(b); if(sum(i=1, l, component(b, i))==sum(i=0, s-1, floor(n/10^i)-10*floor(n/10^(i+1))), print1(n, ", ")))

CROSSREFS

Cf. A000040, A007953, A054899, A131451, A133620, A133900, A134599, A135110.

Sequence in context: A041820 A041826 A041824 this_sequence A041828 A041830 A041832

Adjacent sequences: A037305 A037306 A037307 this_sequence A037309 A037310 A037311

KEYWORD

nonn,base

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com) Nov 29 2008 at the suggestion of Zak Seidov

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