[go: up one dir, main page]

login
A074589 revision #8

A074589
Replace each number n in Pascal's triangle by the n-th prime.
2
2, 2, 2, 2, 3, 2, 2, 5, 5, 2, 2, 7, 13, 7, 2, 2, 11, 29, 29, 11, 2, 2, 13, 47, 71, 47, 13, 2, 2, 17, 73, 149, 149, 73, 17, 2, 2, 19, 107, 263, 349, 263, 107, 19, 2, 2, 23, 151, 433, 701, 701, 433, 151, 23, 2, 2, 29, 197, 659, 1291, 1601, 1291, 659, 197, 29, 2
OFFSET
1,1
REFERENCES
Cf. A074663 (row sums).
EXAMPLE
Triangle begins:
2;
2, 2;
2, 3, 2;
2, 5, 5, 2;
2, 7, 13, 7, 2;
2, 11, 29, 29, 11, 2;
2, 13, 47, 71, 47, 13, 2;
2, 17, 73, 149, 149, 73, 17, 2;
PROG
(PARI) lista(nn) = {for (n=0, nn, for (k=0, n, print1(prime(binomial(n, k)), ", "); ); ); } \\ Michel Marcus, May 18 2013
CROSSREFS
Sequence in context: A324818 A233417 A299741 * A199800 A338094 A165035
KEYWORD
easy,nonn,tabl
AUTHOR
Joseph L. Pe, Sep 26 2002
EXTENSIONS
More terms from Michel Marcus, May 18 2013
STATUS
approved