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.

A284374 a(1) = a(2) = 1; a(n) is the largest prime <= (a(n-a(n-1)) + a(n-a(n-2))) for n > 2.

Original entry on oeis.org

1, 1, 2, 3, 3, 3, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 13, 11, 7, 11, 13, 11, 13, 13, 13, 13, 13, 13, 13, 23, 13, 11, 19, 19, 13, 23, 19, 13, 23, 23, 19, 19, 23, 23, 19, 23, 23, 23, 23, 23, 23, 23, 43, 19, 29, 31, 23, 23, 43, 31, 31, 23, 31, 37, 31, 23, 43, 31, 23, 43, 31
Offset: 1

Views

Author

Altug Alkan, Mar 25 2017

Keywords

Examples

			a(4) = 3 because a(4 - a(3)) + a(4 - a(2)) = a(2) + a(3) = 1 + 2 = 3 and A007917(3) = 3.
		

Crossrefs

Programs

  • Mathematica
    a[1] = a[2] = 1; a[n_] := a[n] = Prime@ PrimePi[a[n - a[n - 1]] + a[n - a[n - 2]]]; Array[a, 73] (* Michael De Vlieger, Mar 25 2017 *)
  • PARI
    a=vector(1000); a[1]=a[2]=1; for(n=3, #a, a[n] = precprime(a[n-a[n-1]]+a[n-a[n-2]])); a

Formula

a(1) = a(2) = 1; a(n) = A007917(a(n-a(n-1)) + a(n-a(n-2))) for n > 2.

A284412 a(1) = 1, a(2) = 2; a(n) is the largest prime <= (a(a(n-1)) + a(n-a(n-1))) for n > 2.

Original entry on oeis.org

1, 2, 3, 3, 5, 5, 7, 7, 7, 7, 7, 11, 7, 13, 7, 13, 7, 13, 11, 13, 13, 13, 13, 13, 17, 13, 19, 17, 17, 13, 19, 17, 19, 17, 19, 17, 19, 19, 23, 19, 23, 23, 23, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 31, 31, 31, 31, 37, 31, 31, 31, 37, 31, 37, 31, 37, 31, 37, 31, 41, 31, 41, 37, 37, 37, 41, 37, 41, 41, 43
Offset: 1

Views

Author

Altug Alkan, Mar 26 2017

Keywords

Examples

			a(6) = 5 because a(a(5)) + a(6 - a(5)) = a(5) + a(1) = 5 + 1 = 6 and A007917(6) = 5
		

Crossrefs

Programs

  • PARI
    a=vector(1000); a[1]=1; a[2]=2; for(n=3, #a, a[n] = precprime(a[a[n-1]]+a[n-a[n-1]])); a

Formula

a(1) = 1, a(2) = 2; a(n) = A007917(a(a(n-1)) + a(n-a(n-1))) for n > 2.
Showing 1-2 of 2 results.