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.

Previous Showing 31-40 of 48 results. Next

A089269 Squarefree numbers congruent to 1 or 2 mod 4.

Original entry on oeis.org

1, 2, 5, 6, 10, 13, 14, 17, 21, 22, 26, 29, 30, 33, 34, 37, 38, 41, 42, 46, 53, 57, 58, 61, 62, 65, 66, 69, 70, 73, 74, 77, 78, 82, 85, 86, 89, 93, 94, 97, 101, 102, 105, 106, 109, 110, 113, 114, 118, 122, 129, 130, 133, 134, 137, 138, 141, 142, 145, 146, 149, 154, 157
Offset: 1

Views

Author

Wolfdieter Lang, Nov 07 2003

Keywords

Comments

a(n) = one-fourth of the (negated) fundamental even discriminants D := b^2-4*a*c<0 of positive definite binary quadratic forms F=a*x^2+b*x*y+c*y^2. See A039957 for the odd numbers and A003657 for the combined even and odd numbers.
The asymptotic density of this sequence is 4/Pi^2 (A185199). - Amiram Eldar, Feb 23 2021

References

  • Duncan A. Buell, Binary Quadratic Forms, Springer-Verlag, NY, 1989, pp. 231-234.
  • Arnold Scholz and Bruno Schoeneberg, Einführung in die Zahlentheorie, 5. Aufl., de Gruyter, Berlin, New York, 1973, Ch. 30.

Crossrefs

Programs

  • Magma
    [n: n  in [1..200] | IsSquarefree(n) and n mod 4 in [1,2]]; // Vincenzo Librandi, Oct 20 2017
  • Mathematica
    Select[Range[200], MemberQ[{1, 2}, Mod[#, 4]]&& SquareFreeQ[#]&] (* Vincenzo Librandi, Oct 20 2017 *)

Extensions

Entry revised by N. J. A. Sloane, May 28 2014

A344231 Positive integers k properly represented by the positive definite binary quadratic form X^2 + 5*Y^2 = k, in increasing order.

Original entry on oeis.org

1, 5, 6, 9, 14, 21, 29, 30, 41, 45, 46, 49, 54, 61, 69, 70, 81, 86, 89, 94, 101, 105, 109, 126, 129, 134, 141, 145, 149, 161, 166, 174, 181, 189, 201, 205, 206, 214, 229, 230, 241, 245, 246, 249, 254, 261, 269, 270, 281, 294, 301, 305, 309, 321, 326, 329, 334, 345, 349, 366, 369, 381, 389, 401, 405
Offset: 1

Views

Author

Wolfdieter Lang, Jun 10 2021

Keywords

Comments

This is one of the bisections of sequence A343238. The other sequence is A344232.
This is a proper subsequence of A020669.
The primes in this sequence are given in A033205.
Discriminant Disc = -20 = -4*5. Class number h(-20) = A000003(5) = 2. The reduced primitive forms representing the two proper (determinant = +1) equivalence classes are the present principal form F1 = [1, 0, 5] and F2 = [2, 2, 3] treated in A344232.
A positive integer k is properly represented by some primitive form of Disc = -20 if and only if the congruence s^2 + 20 == 0 (mod 4*k) has a solution. See, e.g., Buell Proposition 41, p. 50, or Scholz-Schoeneberg Satz 74, p. 105. That is, x^2 + 5 == 0 (mod k), with s = 2*x. For the representative solutions x from {0, 1, ..., k-1}, with k from A343238, see A343239. These solutions x determine the so-called representative parallel primitive forms (rpapfs) [k, 2*x, (x^2 + 5)/k] representing k. They are properly equivalent (via so called R(t)-transformations) to one of the reduced forms F1 or F2. (See also W. Lang's links in A225953 and A324251, but there indefinite forms are considered.)
In order to find out which k from A343238 is represented either by form F1 or F2 the two generic multiplicative characters of Disc = -20, namely Legendre(k|p), with the odd prime p = 5 which divides Disc = -20, and Jacobi(-1|k) can be used. See Buell, pp. 51-52. They lead to the two classes of genera of Disc -20.
The present genus I, the principal one, has for odd primes p, not 5, the values Legendre(p|5) = Legendre(5|p) = +1 and Jacobi(-1|p) = Legendre(-1|p) = +1, leading for odd primes not equal to 5 to A033205. The prime 2 is not represented. The prime 5 is trivially represented. For the other genus II these two characters have values -1. There prime 2 is represented.
For composite k the prime number factorization is used, and for powers of primes the lifting theorem is employed (see, e.g., Apostol, p. 121, Theorem 5.30). The solution for prime 2 represented by form F2 = [2, 2, 3] (from the other genus II) is not liftable to powers of 2. The solution for prime 5 is also not liftable (proof by induction). The solutions of the other primes from A033205 and A106865 are uniquely liftable to powers of these primes. See A343238 for all properly represented k for Disc = -20.
For the present genus I the properly represented integers k are given by 2^a*5^b*Product_{j=1..PI} (pI_j)^(eI(j))*Product_{k=1..PII} (pII_k)^(eII(k)), with a and b from {0, 1} but if PI = PII = 0 (empty products are 1) then a = b = 0 giving a(1) = 1. The odd primes pI_j are from A033205 (== {1, 9} (mod 20)), the primes pII_k are from the odd primes of A106865 (== {3, 7}(mod 20)). The exponents of the second product are restricted: if a = 1 then PII >= 1 and Sum_{k=1..PII} eII(k) is odd. If a = 0 then PII >= 0, and if PII >= 1 then this sum is even.
Neighboring numbers k (twins) begin: [5, 6], [29, 30], [45, 46], [69, 70], [205, 206], [229, 230], [245, 246], [269, 270], [405, 406], ...
For the solutions (X, Y) of F2 = [1, 0, 5] properly representing k = a(n) see A344233.

References

  • Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, pp 121 - 122.
  • D. A. Buell, Binary Quadratic Forms, Springer, 1989.
  • A. Scholz and B. Schoeneberg, Einführung in die Zahlentheorie, Sammlung Göschen Band 5131, Walter de Gruyter, 1973.

Crossrefs

A006643 Class number of quadratic field with discriminant -4n as n runs through A089269: squarefree numbers congruent to 1 or 2 mod 4.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 4, 4, 4, 2, 6, 6, 4, 4, 4, 2, 6, 8, 4, 4, 6, 4, 2, 6, 8, 8, 8, 8, 4, 4, 10, 8, 4, 4, 4, 10, 12, 4, 8, 4, 14, 4, 8, 6, 6, 12, 8, 8, 6, 10, 12, 4, 4, 14, 8, 8, 8, 4, 8, 16, 14, 8, 6, 8, 16, 8, 10, 12, 14, 12, 4, 8, 10, 12, 16, 12, 4, 4, 20, 10, 12, 6, 8, 20, 20, 8, 8, 6, 8, 10, 16
Offset: 1

Views

Author

Keywords

Comments

Equivalently, number of classes of primitive positive definite binary quadratic forms of discriminant -4n as n runs through A089269: squarefree numbers congruent to 1 or 2 mod 4.

References

  • D. A. Buell, Binary Quadratic Forms. Springer-Verlag, NY, 1989, pp. 224-241.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

A subsequence of A000003.

Programs

  • PARI
    for (n=1,50, if(issquarefree(n) && (n%4 == 1 || n%4 == 2), print(n, " ", qfbclassno(-4*n)))) \\ N. J. A. Sloane, May 28 2014

Extensions

Extended and definition corrected by Max Alekseyev, Apr 16 2010

A014599 Class numbers h(D) of imaginary quadratic fields with discriminant D=1-4*n.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 1, 3, 2, 4, 1, 5, 2, 4, 3, 4, 1, 7, 2, 5, 3, 6, 2, 8, 2, 5, 3, 8, 2, 10, 2, 5, 5, 6, 3, 10, 2, 7, 4, 10, 1, 11, 4, 6, 5, 8, 2, 13, 4, 9, 4, 6, 3, 14, 4, 7, 5, 12, 2, 15, 3, 6, 7, 12, 4, 13, 2, 11, 4, 12, 3, 14, 4, 8, 8, 10, 3, 19, 4, 10, 4, 12, 3, 18, 6, 7, 5, 12, 4, 19
Offset: 1

Views

Author

Eric Rains (rains(AT)caltech.edu)

Keywords

Comments

Also class number, or number of equivalence classes of positive definite binary quadratic forms of discriminant -(4n-1). - N. J. A. Sloane, May 28 2014

References

  • D. A. Buell, Binary Quadratic Forms. Springer-Verlag, NY, 1989, pages 19 and 224-230. - N. J. A. Sloane, May 28 2014 [Only the squarefree cases appear on pp. 224-230]
  • H. Cohen, Course in Computational Alg. No. Theory, Springer, 1993, pp. 514-5.

Crossrefs

See A000003 for discriminant -4n.

Programs

  • PARI
    a(n) = qfbclassno(1-4*n)

A039928 Sum of first n terms of A_n (using absolute values of terms).

Original entry on oeis.org

0, 3, 3, 0, 10, 12, 1, 24, 25, 32, 116, 12, 412, 109, 126, 2389, 12497, 28772, 126, 72795, 247786, 770213, 159378001963452599318, 2169128, 442, 311, 378, 789, 10015050, 75, 74253544, 7881195, 2461717833658872781238383813854943728, 51, 17, 824, 855, 2, 29981, 3087, 215308, 123456790123456790123456790123456790123452, 132813776, 1086162642, 1836311902, 400276874544
Offset: 1

Views

Author

Keywords

Comments

Since the sequences in the OEIS occasionally change their initial terms (for editorial reasons), this is an especially ill-defined sequence! - N. J. A. Sloane, Jan 01 2005
The next term, a(47), is currently unknown. - Jianing Song, Oct 07 2018

Examples

			A000001 (Number of groups of order n) begins 0,... -> a(1) = 0
A000002 (Kolakoski sequence) begins 1, 2,... -> a(2) = 3
A000003 begins 1, 1, 1,... -> a(3) = 3
A000004 (The zero sequence) begins 0, 0, 0, 0,... -> a(4) = 0
A000005 (The number of divisors) begins 1, 2, 2, 3, 2, ... -> a(5) = 10
...
A000010 (Euler totient function) begins 1, 1, 2, 2, 4, 2, 6, 4, 6, ... so a(10) = 1 + 1 + 2 + 2 + 4 + 2 + 6 + 4 + 6 + 4 = 32.
		

Crossrefs

Cf. A031135, A031214, A100543 (uses signed values).

Extensions

Corrected and extended by C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 27 2004
a(1) changed from 1 to 0 and extended by Jianing Song, Oct 06 2018

A086227 a(n) = Sum_{1<=k<=4*n, gcd(k,n)=1} (i^k*tan(k*Pi/(4*n)))/(4*i), where i is the imaginary unit.

Original entry on oeis.org

-1, 2, -2, 2, -4, 4, -4, 6, -4, 6, -8, 6, -8, 8, -8, 8, -12, 10, -8, 16, -12, 12, -16, 10, -12, 18, -16, 14, -16, 16, -16, 24, -16, 16, -24, 18, -20, 24, -16, 20, -32, 22, -24, 24, -24, 24, -32, 28, -20, 32, -24, 26, -36, 24, -32, 40, -28, 30, -32, 30, -32, 48, -32, 24, -48, 34, -32, 48, -32, 36, -48, 36, -36, 40, -40, 48, -48
Offset: 2

Views

Author

Benoit Cloitre, Aug 28 2003

Keywords

Comments

This seems to be (-1)^(n+1) times h(-4n^2) = (-1)^(n+1)*A000003(n^2), where h(k) is the class number. Verified for n <= 10^5. - Charles R Greathouse IV, Apr 28 2013

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := p^(e - 1) * Switch[Mod[p, 4], 2, 1, 1, p - 1, 3, p + 1]; s[n_] := Times @@ f @@@ FactorInteger[n]; a[n_] := If[EvenQ[n], -s[n], s[n]/2]; Array[a, 100, 2] (* Amiram Eldar, Mar 07 2022 *)
  • PARI
    a(n)=round(real(1/4/I*sum(k=1,4*n,(I^k)*tan(Pi/4/n*if(gcd(k,n)-1,0,k)))))
    
  • PARI
    a(n)=round(imag(sum(k=1,4*n,if(gcd(k,n)==1,I^k*tan(k*Pi/4/n))))/4) \\ Charles R Greathouse IV, Apr 25 2013
    
  • PARI
    a(n)=my(s);for(k=1,2*n,if(gcd(2*k-1,n)==1,s-=(-1)^k*tan((2*k-1)*Pi/4/n))); round(s/4) \\ Charles R Greathouse IV, Apr 25 2013

Formula

a(n) = -A204617(n) if n is even, and A204617(n)/2 if n is odd (Rabinowitz, 1996). - Amiram Eldar, Mar 07 2022
a(n) = (-1)^(n+1)*A079458(n)/A140434(n). - Ridouane Oudra, Jun 23 2024

Extensions

Definition corrected by Charles R Greathouse IV, Apr 25 2013

A234287 Number of distinct quadratic forms of discriminant -4n by which some prime can be represented.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 4, 4, 2, 3, 5, 3, 4, 4, 3, 4, 4, 3, 4, 4, 3, 5, 5, 2, 4, 4, 5, 5, 4, 3, 5, 5, 3, 4, 5, 4, 5, 5, 4, 4, 5, 4, 7, 4, 2, 6, 5, 4, 5, 5, 4, 6, 6, 3, 6, 6, 4, 5, 6, 3, 6, 6, 5, 6, 4, 4, 7, 5, 3, 6, 7, 4, 6, 5, 5, 7, 7, 5, 5, 4, 5, 6, 7, 3, 6, 6, 5
Offset: 1

Views

Author

V. Raman, Dec 22 2013

Keywords

Comments

This is similar to A232551, except that this includes non-primitive quadratic forms like 2x^2+2xy+4y^2 and 2x^2+4y^2 because the prime 2 can be represented by both of them. But unlike A067752, we do not include quadratic forms like 4x^2+2xy+4y^2 and 4x^2+4xy+4y^2 by which no prime can be represented.
So, when n == 3 (mod 4), this includes the additional non-primitive quadratic form 2x^2+2xy+((n+1)/2)y^2 and when p^2 divides n, where p is prime, this includes the additional non-primitive quadratic form px^2+(n/p)y^2.
If p is a prime and if p^2 does not divide n, then there exist a unique non-primitive quadratic form of discriminant = -4n by which p can be represented if and only if -n is a quadratic residue (mod p) and there exists a multiple of p which can be written in the form x^2+ny^2 in which p appears raised to an odd power, except when p = 2 and n == 3 (mod 8).

Crossrefs

A262144 Square array read by antidiagonals upwards: the n-th row o.g.f. is exp( Sum_{i >= 1} d(n,i+1)*x^i/i ) for n >= 1, where d(n,k) is Shanks's array of generalized Euler and class numbers.

Original entry on oeis.org

1, 1, 2, 1, 11, 10, 1, 46, 241, 108, 1, 128, 2739, 10411, 2214, 1, 272, 16384, 265244, 836321, 75708, 1, 522, 64964, 2883584, 45094565, 112567243, 3895236, 1, 904, 212325, 18852096, 822083584, 12975204810, 22949214033
Offset: 1

Views

Author

Peter Bala, Sep 18 2015

Keywords

Comments

Shanks's array d(n,k) n >= 1, k >= 1, is A235606.
We conjecture that the entries of the present array are all integers. More generally, we conjecture that for r = 1, 2, ... and for each n >= 1, the expansion of exp( Sum_{i >= 1} d(n,i + r)*x^i/i ) has integer coefficients. This is the case r = 1.
For the similarly defined array associated with Shanks' c(n,k) array see A262143.

Examples

			The triangular array begins
1
1   2
1  11     10
1  46    241      108
1 128   2739    10411      2214
1 272  16384   265244    836321       75708
1 522  64964  2883584  45094565   112567243     3895236
1 904 212325 18852096 822083584 12975204810 22949214033 ...
The square array begins (row indexing n starts at 1)
1, 2, 10, 108, 2214, 75708, 3895236, 280356120, 26824493574, ...
1, 11, 241, 10411, 836321, 112567243, 22949214033, 6571897714923, 2507281057330113, ...
1, 46, 2739, 265244, 45094565, 12975204810, 5772785327575, 3656385436507960, 3107332328608143945, ...
1, 128, 16384, 2883584, 822083584, 395136991232, 300338473074688, 330739694704787456, 493338658405976375296, ...
1, 272, 64864, 18852096, 8133183744, 5766226378752, 6562478680375296, 11019751545852395520, 25333348417380699340800, ...
1, 522, 212325, 94501768, 57064909374, 54459242196516, 84430282319806062, 197625548666434041000, 642556291067409622713543, ...
1, 904, 586452, 382674008, 311514279098, 379982635729752, 753288329161251844, 2308779464340711480136, 10003494921382094286802995, ...
		

Crossrefs

Cf. A000182 (d(1,n)), A000464 (d(2,n)), A000191 (d(3,n)), A000318 (d(4,n)), A000320 (d(5,n)), A000411 (d(6,n)), A064072 (d(7,n)), A235605, A235606, A262143, A262145 (row 1 of square array).

A100543 Sum of first n terms of A_n (signed values).

Original entry on oeis.org

0, 3, 3, 0, 10, 12, 1, 24, 25, 32, 116, 12, 412, 109, 126, 2389, 12497, 28772, 126, 72795, 247786, 770213, 159378001963452599312, 2169128, -26, 311, 378, 789, 10015050, 75, 74253544, 7881195, 2461717833658872781238383813854943728, 51, 17, -250, 855, 2, -29979, 3087, 215308, 123456790123456790123456790123456790123452, 132813776, 1086162642, 1836311902, 400276874544
Offset: 1

Views

Author

Keywords

Comments

Since the sequences in the OEIS occasionally change their initial terms (for editorial reasons), this is an especially ill-defined sequence! - N. J. A. Sloane, Jan 01 2005
The next term, a(47), is currently unknown. - Jianing Song, Oct 07 2018

Examples

			A000001 (Number of groups of order n) begins 0,... -> a(1) = 0
A000002 (Kolakoski sequence) begins 1, 2,... -> a(2) = 3
A000003 begins 1, 1, 1,... -> a(3) = 3
A000004 (The zero sequence) begins 0, 0, 0, 0,... -> a(4) = 0
A000005 (The number of divisors) begins 1, 2, 2, 3, 2, ... -> a(5) = 10
...
A000010 (Euler totient function) begins 1, 1, 2, 2, 4, 2, 6, 4, 6, ... so a(10) = 1 + 1 + 2 + 2 + 4 + 2 + 6 + 4 + 6 + 4 = 32.
		

Crossrefs

Extensions

Corrected and extended by C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 27 2004
a(1) changed from 1 to 0 by Jianing Song, Jul 02 2018
Extend by Jianing Song, Oct 07 2018

A262143 Square array read by antidiagonals upwards: the n-th row o.g.f. is exp( Sum_{i >= 1} c(n,i)*x^i/i ) for n >= 1, where c(n,k) is Shanks' array of generalized Euler and class numbers.

Original entry on oeis.org

1, 1, 1, 1, 3, 3, 1, 8, 33, 23, 1, 16, 208, 1011, 371, 1, 30, 768, 14336, 65985, 10515, 1, 46, 2211, 94208, 2091520, 7536099, 461869, 1, 64, 5043, 412860, 24313856, 535261184, 1329205857, 28969177, 1, 96, 9984, 1361948, 164276421, 11025776640, 211966861312, 334169853267, 2454072147
Offset: 1

Views

Author

Peter Bala, Sep 13 2015

Keywords

Comments

Shanks' array c(n,k) n >= 1, k >= 0, is A235605.
We conjecture that the entries of the present array are all integers. More generally, we conjecture that for r = 0,1,2,... and for each n >= 1, the expansion of exp( Sum_{i >= 1} c(n,i + r)*x^i/i ) has integer coefficients. The case n = 1 was conjectured by Hanna in A255895.
For the similarly defined array associated with Shanks' d(n,k) array see A262144.

Examples

			The square array begins (row indexing n starts at 1)
1  1    3      23        371         10515           461869 ..
1  3   33    1011      65985       7536099       1329205857 ..
1  8  208   14336    2091520     535261184     211966861312 ..
1 16  768   94208   24313856   11025776640    7748875976704 ..
1 30 2211  412860  164276421  115699670490  126686112278631 ..
1 46 5043 1361948  778121381  787337024970 1239870854518999 ..
1 64 9984 3716096 2891509760 3978693525504 8522989918683136 ..
...
Array as a triangle
1
1  1
1  3    3
1  8   33      23
1 16  208    1011      371
1 30  768   14336    65985        10515
1 46 2211   94208  2091520      7536099       461869
1 64 5043  412860  24313856   535261184   1329205857 28969177
1 96 9984 1361948 164276421 11025776640 211966861312 ...
...
		

Crossrefs

Cf. A000233 (column 1), A000364 (c(1,n)), A000281 (c(2,n)), A000436 (c(3,n)), A000490 (c(4,n)), A000187 (c(5,n)), A000192 (c(6,n)), A064068 (c(7,n)), A235605, A235606, A255881, A255895, A262144, A262145.
Previous Showing 31-40 of 48 results. Next