login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205592 a(2) = 1, a(3k) = a(3k+1) = a(2k), a(3k+2) = 2a(2k+1) for k >= 1. 6
1, 1, 1, 2, 1, 1, 4, 1, 1, 2, 4, 4, 2, 1, 1, 4, 4, 4, 8, 2, 2, 2, 1, 1, 8, 4, 4, 8, 8, 8, 4, 2, 2, 4, 1, 1, 2, 8, 8, 8, 4, 4, 16, 8, 8, 16, 4, 4, 4, 2, 2, 8, 1, 1, 2, 2, 2, 16, 8, 8, 16, 4, 4, 8, 16, 16, 16, 8, 8, 32, 4, 4, 8, 4, 4, 4, 2, 2, 16, 1, 1, 2, 2, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,4

LINKS

Joseph Myers, Table of n, a(n) for n = 2..1000

2011/12 British Mathematical Olympiad Round 2, Problem 2.

FORMULA

a(n) = A205591(n) - A205591(n-1).

CROSSREFS

Cf. A205591, A205593, A205594, A205595, A205596.

Sequence in context: A249694 A192005 A333810 * A099238 A306846 A327315

Adjacent sequences:  A205589 A205590 A205591 * A205593 A205594 A205595

KEYWORD

easy,nonn

AUTHOR

Joseph Myers, Jan 29 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 07:59 EDT 2020. Contains 334822 sequences. (Running on oeis4.)