cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A132994 Partial sums of A078930.

Original entry on oeis.org

1, 6, 10, 23, 35, 55, 63, 92, 105, 161, 173, 225, 249, 289, 337, 398, 426, 491, 511, 655, 687, 747, 771, 887, 968, 1080, 1120, 1224, 1268, 1492, 1524, 1649, 1697, 1833, 1929, 2098, 2150, 2250, 2346, 2666, 2726, 2886, 2930, 3086, 3242, 3362, 3410, 3654, 3711
Offset: 1

Views

Author

M. F. Hasler, Nov 22 2007

Keywords

Comments

a(10^5)=17924657155 ; a(10^8)=? (Problem 153 on projecteuler.net).

Examples

			a(5) = 35 = A078930(1)+A078930(2)+A078930(3)+A078930(4)+A078930(5).

Links

Crossrefs

Cf. A078930, A078910, A078911.

Programs

A078911 Let r+i*s be the sum of the distinct first-quadrant Gaussian integers dividing n; sequence gives s values.

Original entry on oeis.org

0, 1, 0, 3, 3, 4, 0, 7, 0, 19, 0, 12, 5, 8, 12, 15, 5, 13, 0, 51, 0, 12, 0, 28, 25, 35, 0, 24, 7, 76, 0, 31, 0, 41, 24, 39, 7, 20, 20, 115, 9, 32, 0, 36, 39, 24, 0, 60, 0, 138, 20, 95, 9, 40, 36, 56, 0, 61, 0, 204, 11, 32, 0, 63, 92, 48, 0, 113, 0, 152, 0, 91, 11, 71, 100, 60, 0, 140
Offset: 1

Views

Author

N. J. A. Sloane, Jan 11 2003

Keywords

Comments

A Gaussian integer z = x+iy is in the first quadrant if x > 0, y >= 0. Just one of the 4 associates z, -z, i*z, -i*z is in the first quadrant.
a(A004614(n)) = 0; a(n) = A078910(n)-A000203(n). - Vladeta Jovovic, Jan 11 2003

Examples

			The distinct first-quadrant divisors of 4 are 1, 1+i, 2, 2+2*i, 4, with sum 10+3*i, so a(4) = 3.

Links

Crossrefs

Cf. A078910, A078458, A078908, A078909, A078930.

Programs

  • Mathematica
    Table[Im[Plus@@Divisors[n, GaussianIntegers -> True]], {n, 65}] (* Alonso del Arte, Jan 24 2012; typo fixed by Virgile Andreani, Jul 10 2016 *)
  • PARI
    A078911(n,S=[])=sumdiv(n*I,d,if(real(d)&imag(d)&!setsearch(S,d=vecsort(abs([real(d),imag(d)]))),S=setunion(S,[d]);(d[1]+d[2])>>(d[1]==d[2]))) \\ M. F. Hasler, Nov 22 2007

Extensions

More terms from Vladeta Jovovic, Jan 11 2003

A078910 Let r+i*s be the sum of the distinct first-quadrant Gaussian integers dividing n; sequence gives r values.

Original entry on oeis.org

1, 4, 4, 10, 9, 16, 8, 22, 13, 37, 12, 40, 19, 32, 36, 46, 23, 52, 20, 93, 32, 48, 24, 88, 56, 77, 40, 80, 37, 148, 32, 94, 48, 95, 72, 130, 45, 80, 76, 205, 51, 128, 44, 120, 117, 96, 48, 184, 57, 231, 92, 193, 63, 160, 108, 176, 80, 151, 60, 372, 73, 128, 104, 190, 176
Offset: 1

Views

Author

N. J. A. Sloane, Jan 11 2003

Keywords

Comments

A Gaussian integer z = x+iy is in the first quadrant if x > 0, y >= 0. Just one of the 4 associates z, -z, i*z, -i*z is in the first quadrant.

Examples

			The distinct first-quadrant divisors of 4 are 1, 1+i, 2, 2+2*i, 4, with sum 10+3*i, so a(4) = 10.

Links

Crossrefs

Cf. A000203, A078911, A078458, A078908, A078909, A078930.
Cf. A062327 for the number of first quadrant divisors of n.

Programs

  • Mathematica
    Table[Re[Plus@@Divisors[n, GaussianIntegers -> True]], {n, 65}] (* Alonso del Arte, Jan 24 2012 *)
  • PARI
    A078910(n,S=[])=sigma(n)+sumdiv(n*I,d,if(real(d)&imag(d)&!setsearch(S,d=vecsort(abs([real(d),imag(d)]))),S=setunion(S,[d]);(d[1]+d[2])>>(d[1]==d[2]))) \\ M. F. Hasler, Nov 22 2007

Formula

a(n) = A078911(n)+A000203(n). - Vladeta Jovovic, Jan 11 2003

Extensions

More terms from Vladeta Jovovic, Jan 11 2003
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.