login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A224077 The smallest number n such that (sum of base 2 digits of n) = (sum of base 10 digits of n) for four consecutive integers. 1

%I

%S 3013118,12101118,100503038,100600318,110231038,123000318,131013118,

%T 134213118,211013118,222021118,301002238,310213118,331000318,

%U 332101118,411031038,501020158,501112318,510021118,511301118,520005118,700101118,1001003518,1001500158

%N The smallest number n such that (sum of base 2 digits of n) = (sum of base 10 digits of n) for four consecutive integers.

%C If A037308 is split up into maximal subsets of consecutive integers, the size of these subsets is either two or four.

%H Giovanni Resta, <a href="/A224077/b224077.txt">Table of n, a(n) for n = 1..1000</a>

%Y Cf. A037308.

%K base,nonn

%O 1,1

%A _Reiner Moewald_, Mar 30 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 12:20 EDT 2022. Contains 353833 sequences. (Running on oeis4.)