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!)
A354876 Sum of A344005 and its Dirichlet inverse, where A344005(n) is the smallest positive m such that n divides the oblong number m*(m+1). 2
2, 0, 0, 1, 0, 4, 0, 5, 4, 8, 0, 10, 0, 12, 16, 15, 0, 12, 0, 20, 24, 20, 0, 12, 16, 24, 24, 30, 0, -6, 0, 35, 40, 32, 48, 20, 0, 36, 48, 20, 0, -12, 0, 50, 36, 44, 0, 9, 36, 32, 64, 60, 0, 28, 80, 32, 72, 56, 0, -63, 0, 60, 48, 71, 96, -18, 0, 80, 88, -20, 0, 32, 0, 72, 40, 90, 120, -24, 0, 10, 88, 80, 0, -98, 128 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A344005(n) + A354875(n).
a(1) = 2, and for n > 1, a(n) = -Sum_{d|n, 1<d<n} A344005(d) * A354875(n/d).
PROG
(PARI)
A344005(n) = for(m=1, oo, if((m*(m+1))%n==0, return(m))); \\ From A344005
memoA354875 = Map();
A354875(n) = if(1==n, 1, my(v); if(mapisdefined(memoA354875, n, &v), v, v = -sumdiv(n, d, if(d<n, A344005(n/d)*A354875(d), 0)); mapput(memoA354875, n, v); (v)));
A354876(n) = (A344005(n)+A354875(n));
CROSSREFS
Cf. also A345065.
Sequence in context: A349443 A319340 A349389 * A323408 A347099 A347239
KEYWORD
sign
AUTHOR
Antti Karttunen, Jun 12 2022
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 July 28 16:27 EDT 2024. Contains 374698 sequences. (Running on oeis4.)