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!)
A261018 First differences of A260273. 6

%I #14 Aug 02 2018 07:25:03

%S 2,2,3,3,4,2,3,3,4,4,2,3,3,5,7,5,5,4,3,3,5,5,3,3,4,4,4,5,7,4,5,5,4,3,

%T 3,5,5,3,3,6,8,3,3,4,4,7,4,4,5,5,5,7,7,4,5,9,5,4,4,4,3,3,3,6,3,3,6,9,

%U 5,6,5,7,8,3,3,6,3,3,4,4,4,7,4,4,8,4,4,5,5

%N First differences of A260273.

%C a(n) = A261461(A260273(n)). - _Reinhard Zumkeller_, Aug 30 2015

%H N. J. A. Sloane, <a href="/A261018/b261018.txt">Table of n, a(n) for n = 1..19999</a>

%t b[1] = 1;

%t b[n_] := b[n] = Module[{bits, k}, bits = IntegerDigits[b[n-1], 2]; For[k = 1, True, k++, If[SequencePosition[bits, IntegerDigits[k, 2]] == {}, Return[b[n-1] + k]]]];

%t a[n_] := b[n+1] - b[n];

%t Array[a, 100] (* _Jean-François Alcover_, Aug 02 2018 *)

%o (Python)

%o A261018_list, a = [], 1

%o for i in range(10**3):

%o b, s = 1, format(a,'b')

%o while format(b,'b') in s:

%o b += 1

%o a += b

%o s = format(a,'b')

%o A261018_list.append(b) # _Chai Wah Wu_, Aug 26 2015

%o (Haskell)

%o a261018 n = a261018_list !! (n-1)

%o a261018_list = zipWith (-) (tail a260273_list) a260273_list

%o -- _Reinhard Zumkeller_, Aug 30 2015

%Y Cf. A260273.

%Y Cf. A261645, A261461.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Aug 17 2015

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 September 16 08:47 EDT 2024. Contains 375959 sequences. (Running on oeis4.)