Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118088
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118088 a(0) = 0, a(n) = (1+2*0^(n mod 3))*a(floor(n/3)) + n mod 3. +0
2
0, 1, 2, 3, 2, 3, 6, 3, 4, 9, 4, 5, 6, 3, 4, 9, 4, 5, 18, 7, 8, 9, 4, 5, 12, 5, 6, 27, 10, 11, 12, 5, 6, 15, 6, 7, 18, 7, 8, 9, 4, 5, 12, 5, 6, 27, 10, 11, 12, 5, 6, 15, 6, 7, 54, 19, 20, 21, 8, 9, 24, 9, 10, 27, 10, 11, 12, 5, 6, 15, 6, 7, 36, 13, 14, 15, 6, 7, 18, 7, 8, 81, 28, 29, 30, 11, 12 (list; graph; listen)
OFFSET

0,3

COMMENT

a(0) = 0, a(3*n) = 3*a(n), a(3*n+i) = a(n)+i with 1<=i<=2;

A118089(n) = Min{m: a(m) = n}.

CROSSREFS

Cf. A087808.

Sequence in context: A059036 A085207 A085203 this_sequence A088212 A085208 A085211

Adjacent sequences: A118085 A118086 A118087 this_sequence A118089 A118090 A118091

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Apr 12 2006

page 1

Search completed in 0.005 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research