Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157176
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157176 a(n+1) = a(n - n mod 2) + a(n - n mod 3), a(0) = 1. +0
11
1, 2, 2, 3, 5, 8, 8, 16, 16, 24, 40, 64, 64, 128, 128, 192, 320, 512, 512, 1024, 1024, 1536, 2560, 4096, 4096, 8192, 8192, 12288, 20480, 32768, 32768, 65536, 65536, 98304, 163840, 262144, 262144, 524288, 524288, 786432, 1310720, 2097152, 2097152 (list; graph; listen)
OFFSET

0,2

COMMENT

a(6*k) = 8^k; a(A008588(n))=A001018(n);

a(6*k+1) = a(6*k+2) = 2*8^k; a(A016921(n))=a(A016933(n))=A013730(n);

a(6*k+3) = 3*8^k; a(A016945(n))=A103333(n+1);

a(6*k+4) = 5*8^k; a(A016957(n))=A067412(n+1);

a(6*k+5) = 8^(k+1); a(A016969(n))=A001018(n+1).

FORMULA

a(n+6) = 8*a(n).

CROSSREFS

Sequence in context: A126024 A127678 A114990 this_sequence A111181 A076777 A111123

Adjacent sequences: A157173 A157174 A157175 this_sequence A157177 A157178 A157179

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 24 2009

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