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.

A230598 Lexicographically earliest sequence of distinct positive integers such that all black pixels in the binary plot of the sequence are connected (see Comments for details).

This page as a plain text file.
%I A230598 #22 Feb 16 2025 08:33:20
%S A230598 1,3,2,6,4,5,7,9,11,10,14,8,12,13,15,17,19,18,22,20,21,23,25,27,26,30,
%T A230598 16,24,28,29,31,33,35,34,38,36,37,39,41,43,42,46,40,44,45,47,49,51,50,
%U A230598 54,52,53,55,57,59,58,62,32,48,56,60,61,63,65,67,66,70
%N A230598 Lexicographically earliest sequence of distinct positive integers such that all black pixels in the binary plot of the sequence are connected (see Comments for details).
%C A230598 For any n, m, i, j such that a(n) AND (2^i) <> 0, and a(m) AND (2^j) <>0 (where AND stands for the bitwise AND operator), there exist two sequences of finite length L, say p and b, such that:
%C A230598 (1) p(1)=n, b(1)=i,
%C A230598 (2) p(L)=m, b(L)=j,
%C A230598 (3) a(p(k)) AND (2^b(k)) <> 0 for any k between 1 and L,
%C A230598 (4) |p(k+1)-p(k)| + |b(k+1)-b(k)| = 1 for any k between 1 and L-1.
%C A230598 These two finite sequences define a path of black pixels connecting the black pixels at positions (n,i) and (m,j).
%H A230598 Paul Tek, <a href="/A230598/b230598.txt">Table of n, a(n) for n = 1..10000</a>
%H A230598 Paul Tek, <a href="/A230598/a230598.png">Binary plot of the first 127 terms</a>
%H A230598 Paul Tek, <a href="/A230598/a230598.txt">PERL program for this sequence</a>
%H A230598 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BinaryPlot.html">Binary Plot</a>
%H A230598 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A230598 Empirically, for any k>2 :
%F A230598 (1) a(2^k-1) = 2^k-1,
%F A230598 (2) a(2^k) = 2^k+1,
%F A230598 (3) a(n) = a(n-2^k+1) + 2^k, for any n such that 2^k<=n<2^(k+1)-(k+1),
%F A230598 (4) a(n) = 2^k, for n=2^(k+1)-(k+1),
%F A230598 (5) a(n) = a(n-2^k) + 2^k, for any n such that 2^(k+1)-(k+1)<n<2^(k+1).
%o A230598 (Perl) See Link section.
%Y A230598 Cf. A226077, A230599.
%K A230598 nonn,base,nice
%O A230598 1,2
%A A230598 _Paul Tek_, Oct 24 2013