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

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, 31, 28, 27, 28, 31, 30, 31, 40, 39, 40, 37, 36, 37, 40, 39, 40, 121, 120, 121, 118, 117, 118, 121, 120, 121, 112, 111, 112, 109, 108, 109, 112, 111, 112, 121, 120, 121, 118

Offset: 0

Author

Claude Lenormand (claude.lenormand(AT)free.fr), Apr 02 2001

Keywords

• nonn
• easy
• nice

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
• Zoran Sunic, Tree morphisms, transducers and integer sequences, arXiv:math/0612080 [math.CO], 2006.

Crossrefs

Cf. A005836, A039966, A060372, A060373.

Programs

Haskell

a060374 n = f $ dropWhile (< n) a005836_list where
   f (p:ps) | a039966 (p-n) == 1 && a039966 (2*p-n) == 1 = 2*p - n
            | otherwise                                  = f ps
-- Reinhard Zumkeller, Sep 29 2011

Extensions

Definition clarified by Zoran Sunic, Feb 16 2006