cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A194991 Primes whose squares are odious.

Original entry on oeis.org

2, 5, 7, 11, 17, 19, 23, 29, 31, 41, 43, 59, 67, 71, 79, 89, 97, 101, 103, 113, 127, 131, 139, 149, 157, 163, 167, 173, 179, 181, 193, 197, 223, 227, 229, 239, 251, 257, 263, 271, 283, 307, 313, 349, 353, 373, 379, 383, 389, 401, 409, 421, 431, 433, 439, 449, 457, 467, 479, 487, 509, 523, 547, 563
Offset: 1

Views

Author

Vladimir Shevelev, Sep 07 2011

Keywords

Comments

Subsequence of the numbers 1, 2, 4, 5, 7, 8, 9, 10, 11, 14, 16, 17, 18, 19, 20, 22, 23, 25, 28, 29, 31, 32, 33, ... which have odious squares. See A235331. - R. J. Mathar, Sep 20 2011

Crossrefs

Programs

A298879 Numbers whose square is not odious.

Original entry on oeis.org

0, 3, 6, 12, 13, 15, 21, 24, 26, 27, 30, 37, 42, 45, 47, 48, 52, 53, 54, 57, 60, 61, 63, 69, 73, 74, 81, 83, 84, 90, 93, 94, 96, 99, 104, 105, 106, 107, 108, 109, 111, 114, 115, 119, 120, 122, 123, 126, 133, 137, 138, 141, 146, 148, 151, 155, 159
Offset: 1

Views

Author

Vincenzo Librandi, Jan 31 2018

Keywords

Comments

Complement of A235331.
From Robert Israel, Feb 02 2018: (Start)
2*n is in the sequence if and only if n is in the sequence.
2*n+1 is in the sequence if and only if n*(n+1) is odious. (End)

Crossrefs

Programs

  • Magma
    [n: n in [0..200] | IsEven(&+Intseq(n^2, 2))];
    
  • Maple
    select(t -> convert(convert(t^2,base,2),`+`)::even, [$0..200]); # Robert Israel, Feb 02 2018
  • Mathematica
    Join[{0}, Select[Range[200], !OddQ[DigitCount[#^2, 2][[1]]] &]]
  • PARI
    isok(n) = (hammingweight(n^2) % 2) != 1; \\ Michel Marcus, Jan 31 2018
Showing 1-2 of 2 results.