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.

A373303 First differences of A371176.

This page as a plain text file.
%I A373303 #16 Aug 12 2025 14:46:58
%S A373303 1,2,2,2,2,2,4,2,2,4,4,4,2,2,4,4,4,4,4,8,2,2,4,4,4,4,4,8,4,4,8,8,8,2,
%T A373303 2,4,4,4,4,4,8,4,4,8,8,8,4,4,8,8,8,8,8,16,2,2,4,4,4,4,4,8,4,4,8,8,8,4,
%U A373303 4,8,8,8,8,8,16,4,4,8,8,8,8,8,16,8,8,16,16
%N A373303 First differences of A371176.
%H A373303 Paolo Xausa, <a href="/A373303/b373303.txt">Table of n, a(n) for n = 1..10000</a>
%H A373303 Alistair Bird, <a href="https://outofthenormmaths.wordpress.com/2012/05/13/jozef-schreier-schreier-sets-and-the-fibonacci-sequence/">Jozef Schreier, Schreier sets and the Fibonacci sequence</a>, Out Of The Norm blog, May 13 2012.
%F A373303 a(n) = A371176(n+1) - A371176(n).
%t A373303 Differences[Join[{1}, Select[Range[2, 1000, 2], DigitSum[#, 2] <= IntegerExponent[#, 2] + 1 &]]] (* _Paolo Xausa_, Aug 12 2025 *)
%o A373303 (PARI) isok(n) = hammingweight(n) <= (valuation(n, 2) + 1);
%o A373303 my(v=select(isok, [1..500])); vector(#v-1, k, v[k+1]-v[k])
%Y A373303 Cf. A371176.
%K A373303 nonn
%O A373303 1,2
%A A373303 _Michel Marcus_, May 31 2024