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.

A319701 Filter sequence for sequences that are constant for all odd terms >= 3.

Original entry on oeis.org

1, 2, 3, 4, 3, 5, 3, 6, 3, 7, 3, 8, 3, 9, 3, 10, 3, 11, 3, 12, 3, 13, 3, 14, 3, 15, 3, 16, 3, 17, 3, 18, 3, 19, 3, 20, 3, 21, 3, 22, 3, 23, 3, 24, 3, 25, 3, 26, 3, 27, 3, 28, 3, 29, 3, 30, 3, 31, 3, 32, 3, 33, 3, 34, 3, 35, 3, 36, 3, 37, 3, 38, 3, 39, 3, 40, 3, 41, 3, 42, 3, 43, 3, 44, 3, 45, 3, 46, 3, 47, 3, 48, 3, 49, 3, 50, 3, 51, 3, 52, 3, 53, 3, 54, 3, 55, 3, 56, 3, 57, 3, 58, 3, 59, 3, 60, 3, 61, 3, 62
Offset: 1

Views

Author

Antti Karttunen, Oct 02 2018

Keywords

Comments

For all i, j:
A305801(i) = A305801(j) => A305890(i) = A305890(j) => a(i) = a(j).
a(i) = a(j) => A007814(i) = A007814(j) => A000035(i) = A000035(j).

Crossrefs

Programs

  • PARI
    A319701(n) = if(n<=2, n, if(n%2, 3, 2+(n/2)));

Formula

a(1) = 1, and for n > 1, if n is odd, a(n) = 3, otherwise [when n is even], a(n) = 2+(n/2).