Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090639
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090639 a(0) = 0; a(2n) = 3*a(n), a(2n+1) = a(n) + 1. +0
3
0, 1, 3, 2, 9, 4, 6, 3, 27, 10, 12, 5, 18, 7, 9, 4, 81, 28, 30, 11, 36, 13, 15, 6, 54, 19, 21, 8, 27, 10, 12, 5, 243, 82, 84, 29, 90, 31, 33, 12, 108, 37, 39, 14, 45, 16, 18, 7, 162, 55, 57, 20, 63, 22, 24, 9, 81, 28, 30, 11, 36, 13, 15, 6, 729, 244, 246, 83, 252, 85, 87, 30, 270, 91 (list; graph; listen)
OFFSET

0,3

LINKS

N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), 259-274.

MAPLE

S := 3; f := proc(n) global S; option remember; if n=0 then RETURN(0); fi; if n mod 2 = 0 then RETURN(S*f(n/2)); else f((n-1)/2)+1; fi; end;

CROSSREFS

Cf. A087808, A090640.

Sequence in context: A143074 A104005 A134562 this_sequence A090880 A064614 A016650

Adjacent sequences: A090636 A090637 A090638 this_sequence A090640 A090641 A090642

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Dec 14 2003

page 1

Search completed in 0.002 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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research