The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060372 p(n), positive part of n when n=p(n)-q(n) with p(n), q(n), p(n)+q(n) in A005836, integers written without 2 in base 3. 4
 0, 1, 3, 3, 4, 9, 9, 10, 9, 9, 10, 12, 12, 13, 27, 27, 28, 27, 27, 28, 30, 30, 31, 27, 27, 28, 27, 27, 28, 30, 30, 31, 36, 36, 37, 36, 36, 37, 39, 39, 40, 81, 81, 82, 81, 81, 82, 84, 84, 85, 81, 81, 82, 81, 81, 82, 84, 84, 85, 90, 90, 91, 90, 90, 91, 93, 93, 94, 81, 81, 82, 81 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The graphs of p(n), q(n) are fractals; the graph of p(n)+q(n) is SierpiĆski-like. LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 EXAMPLE Example: 14=27-13=3^3 -(3^0+3^1+3^2), 16=28-12=3^3+3^0 -(3^1+3^2), 20=30-10=3^3+3^1 -(3^0+3^2); 27+13=28+12=30+10=40; 10,12,13, 27, 28, 30 are written without 2 in base 3. PROG (Haskell) a060372 n = (a060374 n + n) `div` 2  -- Reinhard Zumkeller, Jun 09 2012 CROSSREFS Cf. A005836, A060373, A060374. Sequence in context: A086239 A016605 A185395 * A128036 A332311 A332340 Adjacent sequences:  A060369 A060370 A060371 * A060373 A060374 A060375 KEYWORD easy,nice,nonn AUTHOR Claude Lenormand (claude.lenormand(AT)free.fr), Apr 02 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 2 17:02 EDT 2020. Contains 334787 sequences. (Running on oeis4.)