|
Search: id:A100756
|
|
|
| A100756 |
|
Greatest prime factor of the concatenation of terms in the n-th row of Pascal's Triangle. |
|
+0
4
|
|
| 11, 11, 11, 11, 2157293, 37562827, 5935701799, 18285670562881, 34298587945253, 92768668286052709, 101410593913295112092414101, 464557485113006356820471, 170574866715037030033, 829618322366629399154147, 2972851397279413777
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Dario Alejandro Alpern, Factorization using the Elliptic Curve Method.
|
|
EXAMPLE
|
a(4) = 11 is the least prime factor of 14641 = 11^4.
a(5) = 2157293 as 15101051 = 7* 2157293.
|
|
MATHEMATICA
|
f[n_] := (Table[ #[[1]], {1}] & /@ FactorInteger[ FromDigits[ Flatten[ Table[ IntegerDigits[ Binomial[n, k]], {k, 0, n}]]], FactorComplete -> True])[[ -1, 1]]; Table[ f[n], {n, 10}] (from Robert G. Wilson v Dec 11 2004)
|
|
CROSSREFS
|
Cf. A100755.
Sequence in context: A052192 A110733 A090862 this_sequence A079596 A134036 A110415
Adjacent sequences: A100753 A100754 A100755 this_sequence A100757 A100758 A100759
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 23 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 11 2004
|
|
|
Search completed in 0.002 seconds
|
