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).

This page as a plain text file.
%I A072388 #21 Apr 04 2019 22:42:30
%S A072388 1,2,3,5,7,10,13,16,19,23,27,31,36,40,43,47,53,57,61,66,70,74,78,83,
%T A072388 89,95,99,103,106,109,116,124,130,135,141,147,151,157,162,167,173,177,
%U A072388 183,189,193,196,202,212,220,225,229,233,237,243,250,256,262,267,271,276
%N A072388 a(0) = 1; for n > 0, a(n) = floor((prime(n+1) + prime(n) + a(n-1))/3).
%C A072388 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
%H A072388 Wikipedia, <a href="https://en.wikipedia.org/wiki/Smoothing">Smoothing</a>
%e A072388 a(1) = floor((3+2+1)/3) = 2;
%e A072388 a(2) = floor((5+3+2)/3) = 3.
%o A072388 (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
%Y A072388 Cf. A000040, A024675, A302334.
%K A072388 nonn
%O A072388 0,2
%A A072388 _Roger L. Bagula_, Jul 20 2002
%E A072388 Edited by _Dean Hickerson_, Oct 29 2002