|
| |
|
|
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.
|
|
3
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| The graphs of p(n), q(n) are fractals; the graph of p(n)+q(n) is Sierpinski-like.
|
|
|
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.
|
|
|
CROSSREFS
| Cf. A005836, A060373, A060374.
Sequence in context: A086239 A016605 A185395 * A128036 A045794 A065678
Adjacent sequences: A060369 A060370 A060371 * A060373 A060374 A060375
|
|
|
KEYWORD
| easy,nice,nonn
|
|
|
AUTHOR
| Claude Lenormand (claude.lenormand(AT)free.fr), Apr 02 2001
|
| |
|
|
