A199968 a(n) = the smallest non-divisor h of n (1

0, 0, 2, 3, 2, 4, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 2, 4, 2, 3, 2, 3, 2

Offset: 1

Author

Jaroslav Krizek, Nov 26 2011

Keywords

• nonn

Comments

a(n) = A173540(n,1). - Reinhard Zumkeller, Oct 02 2015

Links

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

Crossrefs

Cf. A199969 (the greatest non-divisor h of n (1A199970.

Cf. A173540.

Programs

Haskell

a199968 = head . a173540_row  -- Reinhard Zumkeller, Oct 02 2015

Formula

a(n) = A007978(n) for n>=3.