A199968 - OEIS

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

A199968

a(n) = the smallest non-divisor h of n (1<h<n), or 0 if no such h exists.

4

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

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

OFFSET

1,3

COMMENTS

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

LINKS

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

FORMULA

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

PROG

(Haskell)

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

CROSSREFS

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

Sequence in context: A050206 A127237 A340218 * A066482 A324507 A123725

Adjacent sequences: A199965 A199966 A199967 * A199969 A199970 A199971

KEYWORD

nonn

AUTHOR

Jaroslav Krizek, Nov 26 2011

STATUS

approved