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!)
A345699 Multiplicative with a(p) = a(p-1) and a(p^e) = a(p) + a(e) if e>1. 2

%I #28 Dec 12 2022 01:33:32

%S 1,1,1,2,2,1,1,2,2,2,2,2,2,1,2,3,3,2,2,4,1,2,2,2,3,2,2,2,2,2,2,3,2,3,

%T 2,4,4,2,2,4,4,1,1,4,4,2,2,3,2,3,3,4,4,2,4,2,2,2,2,4,4,2,2,2,4,2,2,6,

%U 2,2,2,4,4,4,3,4,2,2,2,6,3,4,4,2,6,1,2

%N Multiplicative with a(p) = a(p-1) and a(p^e) = a(p) + a(e) if e>1.

%H Amiram Eldar, <a href="/A345699/b345699.txt">Table of n, a(n) for n = 1..10000</a>

%e a(11)=a(10)=a(5)*a(2); a(2)=1; a(5)=a(4)=a(2)+a(2)=2; so a(11)=2.

%p a:= proc(n) option remember; mul(`if`(i[2]=1,

%p a(i[1]-1), a(i[1])+a(i[2])), i=ifactors(n)[2])

%p end:

%p seq(a(n), n=1..100); # _Alois P. Heinz_, Jun 28 2021

%t a[1]=1; a[p_,1]:= a[p-1]; a[p_, s_] := a[p, s] = a[p] + a[s];

%t a[n_]:=a[n]=Module[{aux=FactorInteger[n]},Product[a[aux[[i, 1]], aux[[i, 2]]], {i, Length[aux]}]];

%o (PARI) a(n) = my(f=factor(n)); for (k=1, #f~, f[k,1] = a(f[k,1]-1); if (f[k,2] > 1, f[k,1] += a(f[k,2])); f[k,2] = 1); factorback(f); \\ _Michel Marcus_, Jun 26 2021

%Y Cf. A343068, A345763.

%K nonn,mult

%O 1,4

%A _José María Grau Ribas_, Jun 24 2021

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 March 29 08:08 EDT 2024. Contains 371265 sequences. (Running on oeis4.)