A205592 a(2) = 1, a(3k) = a(3k+1) = a(2k), a(3k+2) = 2a(2k+1) for k >= 1.

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

Offset

2,4

Links

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

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

Index to sequences related to Olympiads and other Mathematical competitions

Formula

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

Crossrefs

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

Cf. A335933.

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