

A104887


Triangle T(n,k) = (nk+1)th prime, read by rows.


4



2, 3, 2, 5, 3, 2, 7, 5, 3, 2, 11, 7, 5, 3, 2, 13, 11, 7, 5, 3, 2, 17, 13, 11, 7, 5, 3, 2, 19, 17, 13, 11, 7, 5, 3, 2, 23, 19, 17, 13, 11, 7, 5, 3, 2, 29, 23, 19, 17, 13, 11, 7, 5, 3, 2, 31, 29, 23, 19, 17, 13, 11, 7, 5, 3, 2, 37, 31, 29, 23, 19, 17, 13, 11, 7, 5, 3, 2, 41, 37, 31, 29
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Repeatedly writing the prime sequence backwards.
Sequence B is called a reverse reluctant sequence of sequence A, if B is triangle array read by rows: row number k lists first k elements of the sequence A in reverse order. Sequence A104887 is the reverse reluctant sequence of sequence the prime numbers (A000040).  Boris Putievskiy, Dec 13 2012


LINKS



FORMULA



EXAMPLE

Triangle begins:
2;
3, 2;
5, 3, 2;
7, 5, 3, 2;
11, 7, 5, 3, 2;
13, 11, 7, 5, 3, 2;
17, 13, 11, 7, 5, 3, 2;


MAPLE

T:=(n, k)>ithprime(nk+1): seq(seq(T(n, k), k=1..n), n=1..13); # Muniru A Asiru, Mar 16 2019


MATHEMATICA

Module[{nn=15, prms}, prms=Prime[Range[nn]]; Table[Reverse[Take[prms, n]], {n, nn}]]//Flatten (* Harvey P. Dale, Aug 10 2021 *)


PROG

(Haskell)
import Data.List (inits)
a104887 n k = a104887_tabl !! (n1) !! (k1)
a104887_row n = a104887_tabl !! (n1)
a104887_tabl = map reverse $ tail $ inits a000040_list
(GAP) P:=Filtered([1..200], IsPrime);;
T:=Flat(List([1..13], n>List([1..n], k>P[nk+1]))); # Muniru A Asiru, Mar 16 2019


CROSSREFS

Cf. A098012 (partial products per row).


KEYWORD



AUTHOR



EXTENSIONS



STATUS

approved



