A263845 A258059(n)+1.

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

Offset: 0

Author

Richard C. Webster, Nov 07 2015

Keywords

• nonn

Comments

Also, a(n) = A258059(n)+1 for n>=1, with a(0)=1.

Zeroless terms of A258059. - Reinhard Zumkeller, Nov 08 2015

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A258059.

Programs

Haskell

a263845 n = a263845_list !! n
a263845_list = filter (> 0) a258059_list
-- Reinhard Zumkeller, Nov 08 2015