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

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,2

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

Links

Table of n, a(n) for n=0..59.

Wikipedia, Smoothing

Example

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

Prog

(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

Crossrefs

Cf. A000040, A024675, A302334.

Sequence in context: A258084 A120367 A072831 * A101433 A225645 A302334

Adjacent sequences: A072385 A072386 A072387 * A072389 A072390 A072391

Keyword

nonn

Author

Roger L. Bagula, Jul 20 2002

Extensions

Edited by Dean Hickerson, Oct 29 2002

Status

approved