A263845 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

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

PROG

(Haskell)

a263845 n = a263845_list !! n

a263845_list = filter (> 0) a258059_list