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.

A072388 a(0) = 1; for n > 0, a(n) = floor((prime(n+1) + prime(n) + a(n-1))/3).

Original entry on oeis.org

1, 2, 3, 5, 7, 10, 13, 16, 19, 23, 27, 31, 36, 40, 43, 47, 53, 57, 61, 66, 70, 74, 78, 83, 89, 95, 99, 103, 106, 109, 116, 124, 130, 135, 141, 147, 151, 157, 162, 167, 173, 177, 183, 189, 193, 196, 202, 212, 220, 225, 229, 233, 237, 243, 250, 256, 262, 267, 271, 276
Offset: 0

Views

Author

Roger L. Bagula, Jul 20 2002

Keywords

Comments

A smoothing applied to the primes as a data set. The method is a hybrid of exponential smoothing and simple moving average (see Wikipedia link). - Peter Munn, Mar 26 2019

Examples

			a(1) = floor((3+2+1)/3) = 2;
a(2) = floor((5+3+2)/3) = 3.
		

Crossrefs

Programs

  • PARI
    lista(nn) = {my(a = 1); print1(a, ", "); for (n=1, nn, a = (prime(n+1) + prime(n) + a)\3; print1(a, ", "););} \\ Michel Marcus, Mar 20 2019

Extensions

Edited by Dean Hickerson, Oct 29 2002