cp's OEIS Frontend

A060374 a(n)=p+q, where n=p-q and p, q, p+q are in A005836 (integers written without 2 in base 3).

%I A060374 #18 Nov 05 2022 12:51:26
%S A060374 0,1,4,3,4,13,12,13,10,9,10,13,12,13,40,39,40,37,36,37,40,39,40,31,30,
%T A060374 31,28,27,28,31,30,31,40,39,40,37,36,37,40,39,40,121,120,121,118,117,
%U A060374 118,121,120,121,112,111,112,109,108,109,112,111,112,121,120,121,118
%N A060374 a(n)=p+q, where n=p-q and p, q, p+q are in A005836 (integers written without 2 in base 3).
%H A060374 Reinhard Zumkeller, <a href="/A060374/b060374.txt">Table of n, a(n) for n = 0..10000</a>
%H A060374 Zoran Sunic, <a href="https://arxiv.org/abs/math/0612080">Tree morphisms, transducers and integer sequences</a>, arXiv:math/0612080 [math.CO], 2006.
%o A060374 (Haskell)
%o A060374 a060374 n = f $ dropWhile (< n) a005836_list where
%o A060374    f (p:ps) | a039966 (p-n) == 1 && a039966 (2*p-n) == 1 = 2*p - n
%o A060374             | otherwise                                  = f ps
%o A060374 -- _Reinhard Zumkeller_, Sep 29 2011
%Y A060374 Cf. A005836, A039966, A060372, A060373.
%K A060374 nonn,easy,nice
%O A060374 0,3
%A A060374 Claude Lenormand (claude.lenormand(AT)free.fr), Apr 02 2001
%E A060374 Definition clarified by _Zoran Sunic_, Feb 16 2006