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-5 of 5 results.

A166407 a(n) = floor(3*(A166406(n)/A005408(n))).

Original entry on oeis.org

-3, 1, 0, 3, -9, 3, 0, 6, 0, 3, 0, 9, -30, 1, 0, 9, 0, 6, 0, 12, 0, 3, 0, 15, -63, 6, 0, 12, 0, 9, 0, 6, 0, 3, 0, 21, 0, 2, 0, 15, -81, 9, 0, 18, 0, 6, 0, 24, 0, 0, 0, 15, 0, 9, 0, 24, 0, 6, 0, 30, -165, 6, 0, 15, 0, 15, 0, 6, 0, 9, 0, 30, 0, 0, 0, 21, 0, 12, 0, 30, 0, 3, 0, 33, -234, 6, 0, 6
Offset: 0

Views

Author

Antti Karttunen, Oct 21 2009

Keywords

Comments

Conjecture: the quotient A166406(i)/A005408(i) has denominator 3 when i is one of the terms of A166101, and it is integral in other cases. If true, then floor in the formula is unnecessary.

Links

Crossrefs

Cf. A166408.

Programs

  • Python
    from sympy import floor, jacobi_symbol as J
def a(n):
    l=0
    m=0
    for i in range(1, 2*n + 2):
        if J(i, 2*n + 1)==-1: l+=i
        elif J(i, 2*n + 1)==1: m+=i
    return floor(3*((l - m)/(2*n + 1)))
print([a(n) for n in range(101)]) # Indranil Ghosh, Jun 12 2017

A166409 Odd numbers corresponding to the positions of zeros in A166406.

Original entry on oeis.org

5, 13, 17, 21, 29, 33, 37, 41, 45, 53, 57, 61, 65, 69, 73, 77, 85, 89, 93, 97, 99, 101, 105, 109, 113, 117, 125, 129, 133, 137, 141, 145, 147, 149, 153, 157, 161, 165, 173, 177, 181, 185, 189, 193, 197, 201, 205, 207, 209, 213, 217, 221, 229, 233, 237, 241
Offset: 1

Views

Author

Antti Karttunen, Oct 21 2009, Oct 22 2009

Keywords

Comments

Those odd numbers 2n+1 for which the sum of i in [1,2n+1] with J(i,2n+1)=-1 is equal to the sum of i in [1,2n+1] with J(i,2n+1)=+1. Here J(i,k) is the Jacobi symbol.
Probably a union of A077425 & A165603: It is clear that A077425 is a subsequence of this sequence. For the remaining terms to be equal to A165603, it is at least required that the intersection of A165603 and A095100 be empty.

Crossrefs

Cf. A077425, A095100, A165603.

Programs

  • Python
    from sympy import jacobi_symbol as J
def a(n):
    l=0
    m=0
    for i in range(1, 2*n + 2):
        if J(i, 2*n + 1)==-1: l+=i
        elif J(i, 2*n + 1)==1: m+=i
    return l - m
print([2*n + 1 for n in range(201) if a(n)==0]) # Indranil Ghosh, Jun 12 2017

A166100 Sum of those positive i <= 2n+1, for which J(i,2n+1)=+1. Here J(i,k) is the Jacobi symbol.

Original entry on oeis.org

1, 1, 5, 7, 27, 22, 39, 15, 68, 76, 63, 92, 250, 117, 203, 186, 165, 175, 333, 156, 410, 430, 270, 423, 1029, 357, 689, 440, 513, 767, 915, 504, 780, 1072, 759, 994, 1314, 725, 1155, 1343, 2187, 1577, 1360, 957, 1958, 1547, 1395, 1330, 2328, 1485, 2525
Offset: 0

Views

Author

Antti Karttunen, Oct 13 2009. Erroneous name corrected Oct 20 2009

Keywords

Comments

Note that this sequence is not equal to the sum of the quadratic residues of 2n+1 in range [1,2n+1], and thus NOT a bisection of A165898.

Examples

			For n=5, we get odd number 11 (2*5+1), and J(i,11) = 1,-1,1,1,1,-1,-1,-1,1,-1,0 when i ranges from 1 to 11, J(i,11) getting value 1 when i=1, 3, 4, 5 and 9, thus a(5)=22.

Links

Crossrefs

A076409(n)=a(A102781(n)). Cf. A166101-A166104, A166405, A166406.
Scheme-code for jacobi-symbol is given at A165601.

Programs

  • Mathematica
    Table[Total[Flatten[Position[JacobiSymbol[Range[2n+1],2n+1],1]]],{n,0,50}] (* Harvey P. Dale, Jun 19 2013 *)
  • Python
    from sympy import jacobi_symbol as J
def a(n): return sum([i for i in range(1, 2*n + 2) if J(i, 2*n + 1)==1]) # Indranil Ghosh, Jun 12 2017

A166405 Sum of those positive i <= 2n+1, for which J(i,2n+1)=-1. Here J(i,k) is the Jacobi symbol.

Original entry on oeis.org

0, 2, 5, 14, 0, 33, 39, 45, 68, 95, 63, 161, 0, 126, 203, 279, 165, 245, 333, 312, 410, 473, 270, 658, 0, 459, 689, 660, 513, 944, 915, 630, 780, 1139, 759, 1491, 1314, 775, 1155, 1738, 0, 1826, 1360, 1479, 1958, 1729, 1395, 2090, 2328, 1485, 2525, 2884
Offset: 0

Views

Author

Antti Karttunen, Oct 21 2009

Keywords

Examples

			For n=5, we get odd number 11 (2*5+1), and J(i,11) = 1,-1,1,1,1,-1,-1,-1,1,-1,0 when i ranges from 1 to 11, J(i,11) obtaining value -1 when i=2, 6, 7, 8 and 10, thus a(5)=33.

Links

Crossrefs

A125615(n)=a(A102781(n)). Cf. A166100, A166406-A166408. The cases where a(i)/A005408(i) is not integer seem also to be given by A166101. This is NOT a bisection of A165898. Scheme-code for jacobi-symbol is given at A165601.

Programs

  • Mathematica
    Table[Total@ Select[Range[2n + 1], JacobiSymbol[#, 2n + 1]==-1 &], {n, 0, 100}] (* Indranil Ghosh, Jun 12 2017 *)
  • Python
    from sympy import jacobi_symbol as J
def a(n): return sum(i for i in range(1, 2*n + 2) if J(i, 2*n + 1)==-1)
# Indranil Ghosh, Jun 12 2017

A166408 a(n) = floor(A166407(n)/3).

Original entry on oeis.org

-1, 0, 0, 1, -3, 1, 0, 2, 0, 1, 0, 3, -10, 0, 0, 3, 0, 2, 0, 4, 0, 1, 0, 5, -21, 2, 0, 4, 0, 3, 0, 2, 0, 1, 0, 7, 0, 0, 0, 5, -27, 3, 0, 6, 0, 2, 0, 8, 0, 0, 0, 5, 0, 3, 0, 8, 0, 2, 0, 10, -55, 2, 0, 5, 0, 5, 0, 2, 0, 3, 0, 10, 0, 0, 0, 7, 0, 4, 0, 10, 0, 1, 0, 11, -78, 2, 0, 2, 0, 5, 0, 8, 0, 2, 0
Offset: 0

Views

Author

Antti Karttunen, Oct 21 2009

Keywords

Comments

See the conjecture in A166407. If true, then a(i) = A166406(i)/A005408(i), whenever i is not in A166101.

Crossrefs

A165951(n)=a(A102781(n)) for n>=2.

Programs

  • Python
    from sympy import floor, jacobi_symbol as J
def a(n):
    l=0
    m=0
    for i in range(1, 2*n + 2):
        if J(i, 2*n + 1)==-1: l+=i
        elif J(i, 2*n + 1)==1: m+=i
    return floor(3*((l - m)/(2*n + 1)))//3
print([a(n) for n in range(101)]) # Indranil Ghosh, Jun 12 2017
Showing 1-5 of 5 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.