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.

A177018 a(n) is the smallest integer >= a(n-1) such that a(n) + A067076(n) + n-1 is an odd prime.

Original entry on oeis.org

3, 3, 3, 4, 4, 5, 5, 6, 8, 8, 10, 11, 11, 12, 14, 16, 16, 18, 19, 19, 21, 22, 24, 27, 28, 28, 29, 29, 30, 36, 37, 39, 39, 43, 43, 45, 47, 48, 50, 52, 52, 56, 56, 57, 57, 62, 67, 68, 68, 69, 71, 71, 75, 77, 79, 81, 81, 83, 84, 84, 88, 94, 95, 95
Offset: 1

Views

Author

Vincenzo Librandi, May 22 2010

Keywords

Examples

			3+0+0=3; 3+1+1=5; 3+2+2=7; 4+4+3=11; 4+5+4=13; etc.
		

Crossrefs

Programs

  • Maple
    N:= 100: # for a(1)..a(N)
    A067076:= [seq((ithprime(i)-3)/2, i=2..N+1)]:
    a:= Vector(N):
    a[1]:= 3:
    for i from 2 to N do
      q:= nextprime(a[i-1]+A067076[i]+i-2);
      a[i]:= q - A067076[i]-i+1;
    od:
    convert(a,list); # Robert Israel, Mar 05 2020
  • PARI
    n=0; c=0;for(i=1,99, t = n+c+A067076(c); if( t%2 == 1 && isprime(t), print1(n", "); c++,/*else*/ n++ )) /* M. F. Hasler, Jun 18 2010 */

Extensions

Better definition from M. F. Hasler, Jun 18 2010
Edited by N. J. A. Sloane, Jul 18 2010