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!)
A329029 a(n) = A069359(A276086(n)), where A276086 converts the primorial base expansion of n into its prime product form and A069359(n) = n * Sum_{p|n} 1/p where p are primes dividing n. 8

%I #11 May 12 2023 09:32:14

%S 0,1,1,5,3,15,1,7,8,31,24,93,5,35,40,155,120,465,25,175,200,775,600,

%T 2325,125,875,1000,3875,3000,11625,1,9,10,41,30,123,12,59,71,247,213,

%U 741,60,295,355,1235,1065,3705,300,1475,1775,6175,5325,18525,1500,7375,8875,30875,26625,92625,7,63,70,287,210,861,84,413,497,1729

%N a(n) = A069359(A276086(n)), where A276086 converts the primorial base expansion of n into its prime product form and A069359(n) = n * Sum_{p|n} 1/p where p are primes dividing n.

%H Antti Karttunen, <a href="/A329029/b329029.txt">Table of n, a(n) for n = 0..2310</a>

%H Antti Karttunen, <a href="/A329029/a329029.txt">Data supplement: n, a(n) computed for n = 0..32768</a>

%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>

%F a(n) = A069359(A276086(n)).

%o (PARI) A329029(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); if(e, m *= (p^e); s += (1/p)); n = n\p; p = nextprime(1+p)); (s*m); };

%o (PARI)

%o A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };

%o A069359(n) = (n*sumdiv(n, d, isprime(d)/d));

%o A329029(n) = A069359(A276086(n));

%Y Cf. A069359, A276086.

%Y Coincides with A327860 on the positions given by A276156.

%K nonn

%O 0,4

%A _Antti Karttunen_, Nov 07 2019

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 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)