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!)
A063955 Sum of the unitary prime divisors (A056169, A056171) of n!. 2
0, 2, 5, 3, 8, 5, 12, 12, 12, 7, 18, 18, 31, 24, 24, 24, 41, 41, 60, 60, 60, 49, 72, 72, 72, 59, 59, 59, 88, 88, 119, 119, 119, 102, 102, 102, 139, 120, 120, 120, 161, 161, 204, 204, 204, 181, 228, 228, 228, 228, 228, 228, 281, 281, 281, 281, 281, 252, 311, 311 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harry J. Smith)
FORMULA
a(n) = Sum_{k=floor(n/2)+1..n} k*c(k), where c is the prime characteristic (A010051). - Wesley Ivan Hurt, Dec 23 2023
EXAMPLE
Prime factors in 20! which have exponent=1 (i.e., unitary p-divisors) are {11,13,17,19}; sum = 60, so a(20)=60. (The sum of all its prime factors (unitary and non-unitary) is A034387(20).)
MAPLE
a:= n-> add(`if`(i[2]=1, i[1], 0), i=ifactors(n!)[2]):
seq(a(n), n=1..60); # Alois P. Heinz, Jun 24 2018
MATHEMATICA
a[n_] := Select[FactorInteger[n!], #[[2]] == 1&][[All, 1]] // Total;
Array[a, 60] (* Jean-François Alcover, Jan 01 2022 *)
PROG
(PARI) a(n) = my(f=factor(n!)~); sum(i=1, length(f), if (f[2, i]==1, f[1, i])); \\ Harry J. Smith, Sep 04 2009
CROSSREFS
Sequence in context: A338060 A169856 A185112 * A097594 A204980 A300896
KEYWORD
nonn,easy
AUTHOR
Labos Elemer, Sep 04 2001
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 26 04:03 EDT 2024. Contains 371989 sequences. (Running on oeis4.)