login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096006 Scan Pascal's triangle (A007318) from left to right, record largest prime factor of each entry. 0
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; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..86.

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

PROG

(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: A218774 A270824 A048198 * A182128 A131294 A276869

Adjacent sequences:  A096003 A096004 A096005 * A096007 A096008 A096009

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, Jul 25 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 04:49 EDT 2020. Contains 334671 sequences. (Running on oeis4.)