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

A060265 Largest prime less than 2n.

Original entry on oeis.org

3, 5, 7, 7, 11, 13, 13, 17, 19, 19, 23, 23, 23, 29, 31, 31, 31, 37, 37, 41, 43, 43, 47, 47, 47, 53, 53, 53, 59, 61, 61, 61, 67, 67, 71, 73, 73, 73, 79, 79, 83, 83, 83, 89, 89, 89, 89, 97, 97, 101, 103, 103, 107, 109, 109, 113, 113, 113, 113, 113, 113, 113, 127, 127, 131
Offset: 2

Views

Author

Labos Elemer, Mar 23 2001

Keywords

Comments

a(n) = A007917(2*n) = A255313(n-1,1) = A255316(n-1,1) = A006530(A255427(n)). - Reinhard Zumkeller, Feb 22 2015

Crossrefs

Apart from initial term, same as A060308.

Programs

  • Haskell
    a060265 = a007917 . (* 2)  -- Reinhard Zumkeller, Feb 22 2015
  • Maple
    seq (prevprime(2*i+1), i=2..256);
  • Mathematica
    Table[NextPrime[2 n, -1], {n, 2, 66}] (* Michael De Vlieger, Jul 04 2016 *)
  • PARI
    a(n) = precprime(2*n-1) \\ Harry J. Smith, Jul 03 2009
    

A255316 Distinct terms in triangle A255313, table read by rows.

Original entry on oeis.org

3, 3, 5, 3, 5, 7, 5, 7, 5, 7, 11, 5, 7, 11, 13, 3, 5, 7, 11, 13, 3, 5, 7, 11, 13, 17, 3, 5, 7, 11, 13, 17, 19, 5, 7, 11, 13, 17, 19, 5, 7, 11, 13, 17, 19, 23, 5, 7, 11, 13, 17, 19, 23, 3, 7, 11, 13, 17, 19, 23, 3, 7, 11, 13, 17, 19, 23, 29, 3, 7, 11, 13, 17
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 22 2015

Keywords

Examples

			See A255313.
		

Crossrefs

Cf. A255313, A255395 (row lengths), A255427 (row products).

Programs

  • Haskell
    import Data.List (nub, sort)
    a255316 n k = a255316_tabf !! (n-1) !! (k-1)
    a255316_row n = a255316_tabf !! (n-1)
    a255316_tabf = map (sort . nub) a255313_tabl
  • Mathematica
    (* A is A088643 *)
    A[n_, 1] := n;
    A[n_, k_] := A[n, k] = For[m = n - 1, m >= 1, m--,
         If[PrimeQ[m + A[n, k - 1]] &&
         FreeQ[Table[A[n, j], {j, 1, k - 1}], m], Return[m]]];
    T[n_] := T[n] = Union[2 MovingAverage[
         Table[A[n+1, k], {k, 1, n+1}], {1, 1}]];
    Array[T, 20] // Flatten (* Jean-François Alcover, Aug 02 2021 *)

A255395 Number of distinct terms in row n of A255313.

Original entry on oeis.org

1, 2, 3, 2, 3, 4, 5, 6, 7, 6, 7, 7, 7, 8, 9, 9, 9, 10, 10, 11, 12, 12, 13, 13, 13, 14, 13, 13, 14, 15, 15, 16, 17, 17, 18, 19, 19, 18, 19, 19, 20, 21, 20, 21, 22, 22, 21, 22, 22, 23, 24, 24, 25, 26, 26, 27, 27, 28, 27, 26, 25, 26, 27, 24, 25, 26, 26, 27, 28
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 22 2015

Keywords

Comments

Row lengths for table A255316;
a(n) = A001221(A255427(n)) = A001222(A255427(n)).

Crossrefs

Programs

  • Haskell
    import Data.List (nub)
    a255395 = length . nub . a255313_row
Showing 1-3 of 3 results.