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.

A307591 Lexicographically earliest sequence of distinct positive terms such that, for any n > 0, A000196(2*a(n) + a(n+1)) is a Fibbinary number (A003714).

This page as a plain text file.
%I A307591 #28 May 05 2019 08:25:33
%S A307591 1,2,3,10,4,8,5,6,7,9,11,12,40,13,38,14,36,15,34,16,32,17,30,18,28,19,
%T A307591 26,20,24,21,22,23,25,27,29,31,33,35,37,39,41,174,52,152,42,172,56,
%U A307591 144,43,170,60,136,44,168,64,128,45,166,68,120,46,164,72,112
%N A307591 Lexicographically earliest sequence of distinct positive terms such that, for any n > 0, A000196(2*a(n) + a(n+1)) is a Fibbinary number (A003714).
%C A307591 This sequence is a variant of A300890 and has interesting graphical features.
%H A307591 Rémy Sigrist, <a href="/A307591/b307591.txt">Table of n, a(n) for n = 1..10000</a> (amended by _Georg Fischer_, May 05 2019)
%H A307591 Rémy Sigrist, <a href="/A307591/a307591.png">Scatterplot of the first 150000 terms</a>
%o A307591 (PARI) s=0; v=1; for (n=1, 64, print1 (v ", "); s+=2^v; for (o=1, oo, if (!bittest(s, o), f=sqrtint(2*v+o); if (bitand(f, 2*f)==0, v=o; break))))
%Y A307591 Cf. A000196, A003714, A300890.
%K A307591 nonn,base,look
%O A307591 1,2
%A A307591 _Rémy Sigrist_, Apr 19 2019