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-1 of 1 results.

A208548 a(n) = floor((4/3)*(2+prime(n)) - prime(n+1)).

Original entry on oeis.org

2, 1, 2, 1, 4, 3, 6, 5, 4, 10, 7, 11, 14, 13, 12, 14, 20, 17, 21, 24, 21, 25, 24, 24, 31, 34, 33, 36, 35, 26, 41, 40, 46, 39, 50, 47, 49, 53, 52, 54, 60, 53, 64, 63, 66, 57, 61, 73, 76, 75, 74, 80, 73, 80, 82, 84, 90, 87, 91, 94, 87, 86, 101, 104, 103, 94, 107
Offset: 1

Views

Author

Zak Seidov, Feb 28 2012

Keywords

Comments

Conjecture: a(n)>0 for all n (cf. A062234, A207480).

Crossrefs

Programs

  • Mathematica
    Table[Floor[(4/3)*(2+Prime[n])-Prime[n+1]],{n,100}]
    Floor[4/3*(2+#[[1]])-#[[2]]]&/@Partition[Prime[Range[70]],2,1] (* Harvey P. Dale, Apr 13 2016 *)
Showing 1-1 of 1 results.