cp's OEIS Frontend

A367092 Starting values of runs of consecutive numbers in A367090, i.e., minima of gaps in the set of sums of distinct powers of 3 and distinct powers of 4.

%I A367092 #21 Mar 28 2025 04:34:33
%S A367092 62,143,207,463,561,642,706,791,872,936,1487,1585,1666,1730,1815,1896,
%T A367092 1960,2249,2395,2650,2748,2829,2893,2978,3059,3123,3674,3772,3853,
%U A367092 3917,4002,4083,4158,4582,4657,4738,4802,4887,4968,5032,5583,5681,5762,5826,5911,5992,6056,6345,6491
%N A367092 Starting values of runs of consecutive numbers in A367090, i.e., minima of gaps in the set of sums of distinct powers of 3 and distinct powers of 4.
%C A367092 Also: terms a(n) of A367090 such that a(n)-1 is not in A367090.
%C A367092 ("Consecutive" includes the possibility of having a gap of just one single isolated missing number.)
%C A367092 This sequence together with A367091 (run lengths), provide a "compressed version" of A367090.
%H A367092 Hugo Pfoertner, <a href="/A367092/b367092.txt">Table of n, a(n) for n = 1..10000</a>
%F A367092 { x in A367090 | x-1 is not in A367090 }
%e A367092 Sequence A367090 (= numbers that are not the sum of distinct powers of 3 or 4) starts (62, 63, 143, 144, 207, 208, 209, 210, ...), so the first three runs of consecutive terms start at a(1) = 62, a(2) = 143, and a(3) = 207.
%o A367092 (PARI) A367092_upto(N, A=A367090_upto(N))=[ A[k] | k<-[1..#A], A[k-(k>1)]!=A[k]-1 ]
%Y A367092 Cf. A367090, A367091; A005836 and A000695 (sums of distinct powers of 3 resp. 4).
%K A367092 nonn
%O A367092 1,1
%A A367092 _M. F. Hasler_, Nov 08 2023