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-6 of 6 results.

A175856 a(n) = a(n-1) - 1 if n is composite, a(n) = n otherwise.

Original entry on oeis.org

1, 2, 3, 2, 5, 4, 7, 6, 5, 4, 11, 10, 13, 12, 11, 10, 17, 16, 19, 18, 17, 16, 23, 22, 21, 20, 19, 18, 29, 28, 31, 30, 29, 28, 27, 26, 37, 36, 35, 34, 41, 40, 43, 42, 41, 40, 47, 46, 45, 44, 43, 42, 53, 52, 51, 50, 49, 48, 59, 58, 61, 60, 59, 58, 57, 56, 67, 66
Offset: 1

Views

Author

Jaroslav Krizek, Sep 29 2010

Keywords

Comments

a(n) = n for noncomposite n, a(n) = 2 * (previous prime (n)) - n for composite n.
See A175859 - absent positive integers (pairs of consecutive numbers) in sequence: 8, 9, 14, 15, 24, 25, 32, 33, ...
a(n) = A075365(n) except at n = 1 and n = 10. - Alexandre Herrera, Nov 11 2023

Examples

			a(7) = 7 (7 is a noncomposite number), a(8) = 2*7 - 8 = 6 (8 is composite).
		

Crossrefs

Programs

  • Maple
    a:= proc(n) option remember;
          `if`(n=1 or isprime(n), n, a(n-1)-1)
        end:
    seq(a(n), n=1..80);  # Alois P. Heinz, Jun 22 2021
  • Mathematica
    a[1] := 1; a[n_] := a[n] = If[PrimeQ[n], n, a[n - 1] - 1] (* Ben Branman, Jan 02 2011 *)
    nxt[{n_,a_}]:={n+1,If[CompositeQ[n+1],a-1,n+1]}; NestList[nxt,{1,1},70][[All,2]] (* Harvey P. Dale, Jan 01 2023 *)
  • PARI
    a(n)=if(n==1, 1, 2*precprime(n)-n) \\ Charles R Greathouse IV, Apr 22 2022~

Extensions

Corrected by Jaroslav Krizek, Oct 01 2010

A175859 a(n) = numbers k in increasing order such that A175856(m) = k has no solution for any m, where A175856(m): a(m) = m for m = noncomposites, a(m) = previous term - 1 for m = composites.

Original entry on oeis.org

8, 9, 14, 15, 24, 25, 32, 33, 38, 39, 54, 55, 62, 63, 74, 75, 90, 91, 92, 93, 98, 99, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 140, 141, 142, 143, 144, 145, 158, 159, 182, 183, 184, 185, 186, 187, 212, 213
Offset: 1

Views

Author

Jaroslav Krizek, Sep 29 2010

Keywords

Comments

Absent positive integers (pairs of consecutive numbers) in sequence A175856(n).
Complement of A175857(n).
A175860(a(n)) = 0, A175861(a(n)) = 1, A175862(a(n)) = 0.

Crossrefs

Formula

a(2k) = a(2k-1) + 1 for k >= 1.

A175861 a(n) = characteristic function of numbers k such that A175856(m) = k has no solution for any m, where A175856(m): a(m) = m for m = noncomposites, a(m) = previous term - 1 for m = composites.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0
Offset: 1

Views

Author

Jaroslav Krizek, Sep 29 2010

Keywords

Comments

a(n) = characteristic function of numbers from A175859(n). a(n) = 1 if A175856(m) not equal to n for any m, else 0. a(n) = 1 for such n that A175862(n) = 0. a(n) = 0 for such n that A175862(n) >= 1. a(n) + A175860(n) = A000012(n).

Crossrefs

Programs

Formula

a(n) = 1 - A175860(n).

A175857 a(n) = possible values of A175856(m) in increasing order, where A175856(m): a(m) = m for m = noncomposites, a(m) = previous term - 1 for m = composites.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 16, 17, 18, 19, 20, 21, 22, 23, 26, 27, 28, 29, 30, 31, 34, 35, 36, 37, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 56, 57, 58, 59, 60, 61, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88
Offset: 1

Views

Author

Jaroslav Krizek, Sep 29 2010

Keywords

Comments

Complement of A175859(n). A175860(a(n)) = 1, A175862(a(n)) >= 1.

Crossrefs

A175858 a(n) = all values of A175856(m) in increasing order, where A175856(m): a(m) = m for m = noncomposites, a(m) = previous term - 1 for m = composites.

Original entry on oeis.org

1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 10, 10, 11, 11, 12, 13, 16, 16, 17, 17, 18, 18, 19, 19, 20, 21, 22, 23, 26, 27, 28, 28, 29, 29, 30, 31, 34, 35, 36, 37, 40, 40, 41, 41, 42, 42, 43, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 56, 57, 58, 58, 59, 59, 60
Offset: 1

Views

Author

Jaroslav Krizek, Sep 29 2010

Keywords

Comments

A175860(a(n)) = 1, A175862(a(n)) >= 1.

Crossrefs

Extensions

Corrected by Jaroslav Krizek, Oct 01 2010

A175862 a(n) = frequency of values n in A175856(m), where A175856(m): a(m) = m for m = noncomposites, a(m) = previous term - 1 for m = composites.

Original entry on oeis.org

1, 2, 1, 2, 2, 1, 1, 0, 0, 2, 2, 1, 1, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1, 0, 0, 1, 1, 2, 2, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 2, 2, 1
Offset: 1

Views

Author

Jaroslav Krizek, Sep 29 2010

Keywords

Comments

a(n) >= 1 for such n that A175860(n) = 1, a(n) >= 1 if A175856(m) = n for any m. a(n) = 0 for such n that A175860(n) = 0, a(n) = 0 if A175856(m) = n has no solution for any m.

Crossrefs

Extensions

Corrected by Jaroslav Krizek, Oct 01 2010
Showing 1-6 of 6 results.