A231180 - 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

A231180

Let A={2,3,6,8,9,11,14,...} be the sequence of numbers k>=1 such that k+5 is odious (A000069). Let B be the complement of A. The sequence lists numbers for which the number of A-divisors equals the number of B-divisors.

1, 4, 9, 16, 36, 121, 144, 289, 441, 484, 529, 1156, 1369, 1600, 1764, 2025, 2116, 2209, 3249, 3481, 4624, 5041, 5476, 6241, 6889, 7056, 7569, 7921, 8100, 8464, 8649, 8836, 11449, 12321, 12769, 12996, 13924, 14641, 15129, 16641, 20164, 24336, 24649, 24964

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

OFFSET

1,2

COMMENTS

All terms are perfect squares.

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

Vladimir Shevelev, A set of sequences of perfect squares

EXAMPLE

n=16 has 4 proper divisors {1,2,4,8} from which 2 from A {2,8} and 2 from B {1,4}. So 16 is in the sequence.

MATHEMATICA

odiousQ[n_]:=OddQ[DigitCount[n, 2][[1]]];