A169695 - OEIS

A169695

a(n) = 1 if n is a square, otherwise a(n) = 2.

1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2

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

OFFSET

0,3

COMMENTS

Also number of central divisors of n, if n >= 1. - Omar E. Pol, Feb 10 2011.

Length of n-th row in the array of A207375, if n >= 1. - Omar E. Pol, Feb 27 2012

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..65537

Index entries for sequences computed from exponents in factorization of n.

FORMULA

From Omar E. Pol, Feb 10 2011: (Start)

a(n) = 2 - A010052(n).