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!)
A074320 a(n) = sum of smallest and largest prime factors of n, for n>1; a(1)=2. 7
2, 4, 6, 4, 10, 5, 14, 4, 6, 7, 22, 5, 26, 9, 8, 4, 34, 5, 38, 7, 10, 13, 46, 5, 10, 15, 6, 9, 58, 7, 62, 4, 14, 19, 12, 5, 74, 21, 16, 7, 82, 9, 86, 13, 8, 25, 94, 5, 14, 7, 20, 15, 106, 5, 16, 9, 22, 31, 118, 7, 122, 33, 10, 4, 18, 13, 134, 19, 26, 9, 142, 5, 146, 39, 8, 21, 18, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
If n is prime, a(n) = 2n; the only prime factor, n itself, is taken as both the "smallest" and "largest" prime factor of n. - Jon E. Schoenfield, Jan 14 2015
LINKS
FORMULA
a(n) = A020639(n) + A006530(n).
MATHEMATICA
f[n_]:=Transpose[FactorInteger[n]][[1]]; Table[First[f[n]]+Last[f[n]], {n, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 08 2011 *)
PROG
(PARI) a(n) = if (n==1, 2, my(f=factor(n)); f[1, 1] + f[#f~, 1]); \\ Michel Marcus, Jan 14 2015
CROSSREFS
Sequence in context: A154542 A360459 A360458 * A014428 A180935 A151886
KEYWORD
easy,nonn
AUTHOR
Jason Earls, Sep 26 2002
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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)