The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A340189 a(n) = n + A340187(n). 3
 2, 1, 1, 4, 1, 9, 1, 8, 11, 17, 1, 11, 1, 25, 27, 16, 1, 13, 1, 17, 41, 41, 1, 24, 37, 49, 25, 21, 1, 1, 1, 32, 69, 65, 79, 40, 1, 73, 83, 40, 1, -7, 1, 35, 21, 89, 1, 48, 79, 17, 111, 39, 1, 61, 131, 60, 125, 113, 1, 83, 1, 121, 27, 64, 145, -27, 1, 53, 153, -49, 1, 71, 1, 145, 23, 57, 193, -31, 1, 80, 83, 161, 1, 131 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Antti Karttunen, Table of n, a(n) for n = 1..8191 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537 FORMULA a(n) = n + A340187(n). a(n) = A340188(n) + A318828(n). PROG (PARI) up_to = 65537; A063994(n) = { my(f=factor(n)); prod(i=1, #f~, gcd(f[i, 1]-1, n-1)); }; DirInverse(v) = { my(u=vector(#v)); u[1] = (1/v[1]); for(n=2, #v, u[n] = -sumdiv(n, d, if(d

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 22:38 EST 2021. Contains 340247 sequences. (Running on oeis4.)