login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132139 a(n) = f(n,1) with f(m,x) = if m<3 then (if m=1 then x else 0) else (if m mod 3 = 0 then 0 else f([m/3], x*(1 + m mod 3) + 1)). 3
1, 0, 0, 3, 4, 0, 0, 0, 0, 0, 0, 0, 7, 9, 0, 10, 13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 19, 0, 21, 27, 0, 0, 0, 0, 22, 28, 0, 31, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000

CROSSREFS

Sequence in context: A076253 A081174 A171604 * A045951 A025120 A025096

Adjacent sequences:  A132136 A132137 A132138 * A132140 A132141 A132142

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 20 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 07:07 EST 2012. Contains 205871 sequences.