cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A337637 Number of numbers k <= n such that both k and k+1 are in A020899.

This page as a plain text file.
%I A337637 #11 Feb 05 2023 01:59:26
%S A337637 0,1,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,4,5,5,5,5,5,5,5,6,6,6,7,8,8,8,
%T A337637 8,8,8,8,8,8,9,9,9,10,11,11,11,11,12,13,13,13,13,13,13,13,13,13,13,13,
%U A337637 13,14,14,14,15,16,16,16,16,17,18,18,18,18,18,18,18,19,20,20,20
%N A337637 Number of numbers k <= n such that both k and k+1 are in A020899.
%D A337637 Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.
%H A337637 Amiram Eldar, <a href="/A337637/b337637.txt">Table of n, a(n) for n = 0..10000</a>
%t A337637 s = SequencePosition[Mod[DigitCount[Select[Range[0, 400], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {1, 1}][[;; , 1]] - 1; t = Table[0, {s[[-1]] + 1}]; t[[s + 1]] = 1; Accumulate[t] (* _Amiram Eldar_, Feb 05 2023 *)
%Y A337637 Cf. A020899, A095096, A337287, A337288, A337289, A337290, A337634, A337635, A337636.
%K A337637 nonn,base
%O A337637 0,3
%A A337637 _N. J. A. Sloane_, Sep 12 2020
%E A337637 Offset corrected by _Amiram Eldar_, Feb 05 2023