login
A060374
a(n)=p+q, where n=p-q and p, q, p+q are in A005836 (integers written without 2 in base 3).
4
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,3
LINKS
Zoran Sunic, Tree morphisms, transducers and integer sequences, arXiv:math/0612080 [math.CO], 2006.
PROG
(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
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
Claude Lenormand (claude.lenormand(AT)free.fr), Apr 02 2001
EXTENSIONS
Definition clarified by Zoran Sunic, Feb 16 2006
STATUS
approved