The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212848 Least prime factor of n-th central trinomial coefficient (A002426). 1
1, 1, 3, 7, 19, 3, 3, 3, 3, 43, 7, 3, 113, 73, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 7, 17, 3, 719, 7, 3, 3, 3, 3, 967, 9539, 3, 17, 47, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 19 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
A002426(n) is prime for n = 2, 3, 4, no more through 10^5. A002426 is semiprime iff A102445(n) = 2 (as is the case for n = 5, 6, 7, 9, 10, 12, 13).
LINKS
FORMULA
a(n) = A020639(A002426(n)).
EXAMPLE
a(9) = 43 because A002426(9) = 3139 = 43 * 73.
MAPLE
A002426:= gfun:-rectoproc({(n+2)*a(n+2)-(2*n+3)*a(n+1)-3*(n+1)*a(n) = 0, a(0)=1, a(1)=1}, a(n), remember):
lpf:= proc(n) local F;
F:= map(proc(t) if t[1]::integer then t[1] else NULL fi end proc,
ifactors(n, easy)[2]);
if nops(F) > 0 then min(F)
else min(numtheory:-factorset(n))
fi
end proc:
lpf(1):= 1:
map(lpf @ A002426, [$0..100]); # Robert Israel, Jun 20 2017
MATHEMATICA
a = b = 1; t = Join[{a, b}, Table[c = ((2 n - 1) b + 3 (n - 1) a)/n; a = b; b = c; c, {n, 2, 100}]]; Table[FactorInteger[n][[1, 1]], {n, t}] (* T. D. Noe, May 30 2012 *)
PROG
(PARI) a(n) = my(x=polcoeff((1 + x + x^2)^n, n)); if (x==1, 1, vecmin(factor(x)[, 1])); \\ Michel Marcus, Jun 20 2017
CROSSREFS
Sequence in context: A173449 A270519 A361087 * A217371 A088629 A075609
KEYWORD
nonn,easy
AUTHOR
Jonathan Vos Post, May 28 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 10:34 EDT 2024. Contains 372760 sequences. (Running on oeis4.)