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.

A244584 a(n) = n OR 3.

Original entry on oeis.org

3, 3, 3, 3, 7, 7, 7, 7, 11, 11, 11, 11, 15, 15, 15, 15, 19, 19, 19, 19, 23, 23, 23, 23, 27, 27, 27, 27, 31, 31, 31, 31, 35, 35, 35, 35, 39, 39, 39, 39, 43, 43, 43, 43, 47, 47, 47, 47, 51, 51, 51, 51, 55, 55, 55, 55, 59, 59, 59, 59, 63, 63, 63, 63, 67, 67, 67
Offset: 0

Views

Author

Gary Detlefs, Jun 30 2014

Keywords

Comments

Terms of A004767 repeated four times. [Bruno Berselli, Jul 01 2014]

Crossrefs

Cf. A004767.
Cf. similar sequences listed in A244587.

Programs

  • Magma
    [BitwiseOr(n, 3): n in [0..70]]; // Bruno Berselli, Jul 01 2014
    
  • Maple
    with(Bits): seq(Or(n,3),n = 1..60);
  • Python
    def A244584(n): return n|3 # Chai Wah Wu, Jan 18 2023

Formula

a(n) = (n+3)- (n AND 3).
a(n) = (n XOR 3) + (n AND 3).
a(n) = n + ((3*n+3) mod 4).
a(n) = 4*floor((n+4)/4)-1.
G.f.: (3 + x^4)/(1 - x - x^4 + x^5). [Bruno Berselli, Jul 01 2014]