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.

A297126 Numbers whose base-3 digits d(m), d(m-1),..., d(0) have m=0 or else d(i) = d(i+1) for some i in {0,1,...,m-1}.

This page as a plain text file.
%I A297126 #11 Nov 13 2021 04:48:03
%S A297126 1,2,4,8,9,12,13,14,17,18,22,24,25,26,27,28,29,31,35,36,37,38,39,40,
%T A297126 41,42,43,44,45,49,51,52,53,54,55,56,58,62,63,66,67,68,71,72,73,74,75,
%U A297126 76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,93,94,95
%N A297126 Numbers whose base-3 digits d(m), d(m-1),..., d(0) have m=0 or else d(i) = d(i+1) for some i in {0,1,...,m-1}.
%C A297126 These numbers comprise the complement of the set of numbers in the union of A297124 and A297125.
%H A297126 Robert Israel, <a href="/A297126/b297126.txt">Table of n, a(n) for n = 1..10000</a>
%e A297126 Base-3 digits of 95: 1,0,1,1,2, so that 95 is in the sequence.
%p A297126 filter:= proc(n) local L;
%p A297126   L:= convert(n,base,3);
%p A297126   member(0,L[2..-1]-L[1..-2])
%p A297126 end proc:
%p A297126 filter(1):= true: filter(2):= true:
%p A297126 select(filter, [$1..100]); # _Robert Israel_, Apr 12 2018
%t A297126 a[n_, b_] := Sign[Differences[IntegerDigits[n, b]]]; z = 300;
%t A297126 b = 3; t = Table[a[n, b], {n, 1, 10*z}];
%t A297126 u = Select[Range[z], ! MemberQ[t[[#]], 0] && First[t[[#]]] == 1 &]   (* A297124 *)
%t A297126 v = Select[Range[z], ! MemberQ[t[[#]], 0] && First[t[[#]]] == -1 &]  (* A297125 *)
%t A297126 Complement[Range[z], Union[u, v]]  (* A297126 *)
%Y A297126 Cf. A297124, A297125.
%K A297126 nonn,easy,base
%O A297126 1,2
%A A297126 _Clark Kimberling_, Apr 10 2018
%E A297126 3 removed by _Robert Israel_, Apr 12 2018