A205591 -id:A205591 - cp's OEIS frontend

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

Joseph Myers, Jan 29 2012

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

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

Cf. A335933.

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

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

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 2, 0, 0, 1, 2, 2, 1, 0, 0, 2, 2, 2, 3, 1, 1, 1, 0, 0, 3, 2, 2, 3, 3, 3, 2, 1, 1, 2, 0, 0, 1, 3, 3, 3, 2, 2, 4, 3, 3, 4, 2, 2, 2, 1, 1, 3, 0, 0, 1, 1, 1, 4, 3, 3, 4, 2, 2, 3, 4, 4, 4, 3, 3, 5, 2, 2, 3, 2, 2, 2, 1, 1, 4, 0, 0, 1, 1, 1, 2, 1, 1, 5

Offset: 2

Joseph Myers, Jan 29 2012

Joseph Myers, Table of n, a(n) for n = 2..1000
2011/12 British Mathematical Olympiad Round 2, Problem 2.

Cf. A205591, A205592, A205594, A205595, A205596.

a(n) = log_2(A205592(n)).

A205594 n such that A205592(n) > n.

Original entry on oeis.org

242, 818, 1841, 2762, 6215, 9323, 13985, 14003, 14012, 20978, 21005, 26243, 29888, 31467, 31468, 31481, 31508, 31529, 31589, 39365, 47201, 47202, 47203, 47222, 47262, 47263, 47294, 47384, 59048, 59156, 59183, 61235, 70802, 70805, 70895, 88572, 88573, 88775, 91853

Offset: 1

Joseph Myers, Jan 29 2012

nonn

Joseph Myers, Table of n, a(n) for n = 1..1000
2011/12 British Mathematical Olympiad Round 2, Problem 2.

Cf. A205591, A205592, A205593, A205595, A205596.

A205595 A205592(A205594(n)).

Original entry on oeis.org

256, 1024, 2048, 4096, 8192, 16384, 32768, 16384, 16384, 65536, 32768, 32768, 32768, 65536, 65536, 32768, 65536, 32768, 32768, 65536, 131072, 65536, 65536, 65536, 65536, 65536, 65536, 65536, 131072, 65536, 65536, 65536, 262144, 131072, 131072, 131072, 131072, 131072

Offset: 1

Joseph Myers, Jan 29 2012

nonn

Joseph Myers, Table of n, a(n) for n = 1..1000
2011/12 British Mathematical Olympiad Round 2, Problem 2.

Cf. A205591, A205592, A205593, A205594, A205596.

A205596 Least k such that A205592(k) = 2^n.

Original entry on oeis.org

2, 5, 8, 20, 44, 71, 107, 161, 242, 545, 818, 1841, 2762, 6215, 9323, 13985, 20978, 47201, 70802, 159305, 238958, 358910, 807548, 1814615, 2721923, 4082885, 6124328, 13779557, 20669336, 40222412, 87267041

Offset: 0

Joseph Myers, Jan 29 2012

nonn

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

Cf. A205591, A205592, A205593, A205594, A205595.

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Formula

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

Views

Author

Keywords

Links

Crossrefs

Formula

A205594 n such that A205592(n) > n.

Views

Author

Keywords

Links

Crossrefs

A205595 A205592(A205594(n)).

Views

Author

Keywords

Links

Crossrefs

A205596 Least k such that A205592(k) = 2^n.

Views

Author

Keywords

Links

Crossrefs