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!)
A083344 a(n) = A082457(n) - A066715(n) = gcd(2n+1, A057643(2n+1)) - gcd(2n+1, A000203(2n+1)). 4
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 30, 0, 0, 0, 0, 0, 0, 4, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,22
LINKS
FORMULA
a(n) = gcd(2n+1, lcm(1+D(2n+1))) - gcd(2n+1, sigma(2n+1)), gcd(2n+1, A057643(2n+1)) - gcd(2n+1, A000203(2n+1)), where D(x) is the set of divisors of x.
EXAMPLE
n=22: 2n+1 = 45, A057643(45) = 5520, a(22) = gcd(45,5520) = 15 while A066715(45) = 3; a(22) = 15-3 = 12; sites where nonzero terms appear see in A082452.
MATHEMATICA
di[x_] := Apply[LCM, Divisors[x]+1] (*A066715=*)t1=Table[GCD[2*n+1, DivisorSigma[1, 2*n+1]], {n, 1, 2048}]; (*A082457=*)t2=Table[GCD[2*w+1, di[1+2*w]], {w, 1, 2048}]; (*A083344=*)t2-t1;
PROG
(PARI) a(n)=gcd(lcm(apply(d->d+1, divisors(2*n+1))), 2*n+1)-gcd(sigma(2*n+1), 2*n+1) \\ Charles R Greathouse IV, Feb 14 2013
CROSSREFS
Sequence in context: A243534 A257304 A241570 * A294889 A308425 A063863
KEYWORD
sign
AUTHOR
Labos Elemer, Apr 25 2003
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 March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)