|
Search: id:A096006
|
|
|
| A096006 |
|
Scan Pascal's triangle (A007318) from left to right, record largest prime factor of each entry. |
|
+0
1
|
|
| 2, 3, 3, 2, 3, 2, 5, 5, 5, 5, 3, 5, 5, 5, 3, 7, 7, 7, 7, 7, 7, 2, 7, 7, 7, 7, 7, 2, 3, 3, 7, 7, 7, 7, 3, 3, 5, 5, 5, 7, 7, 7, 5, 5, 5, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 7, 13, 13, 13, 13, 13, 13, 13
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
n Pascal's Triangle
1 1
2 1 2 1
3 1 3 3 1
4 1 4 6 4 1
so 2,3,2 = largest prime factors of row 4 = entries position 4,5,6 in the sequence.
4' 2 3 2
|
|
PROGRAM
|
(PARI) \Largest prime factors of numbers in Pascal's triangle. pascal(n) = { local(x, y, z, f, z1); for(x=1, n, for(y=1, x-1, z=binomial(x, y); p=omega(z); f=Vec(factor(z)); z1=f[1][p]; print1(z1", ") ); ) }
|
|
CROSSREFS
|
Sequence in context: A130631 A130633 A048198 this_sequence A131294 A102313 A007538
Adjacent sequences: A096003 A096004 A096005 this_sequence A096007 A096008 A096009
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Jul 25 2004
|
|
|
Search completed in 0.002 seconds
|
