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.

A060728 Numbers n such that Ramanujan's equation x^2 + 7 = 2^n has an integer solution.

Original entry on oeis.org

3, 4, 5, 7, 15
Offset: 1

Views

Author

Lekraj Beedassy, Apr 25 2001

Keywords

Comments

See A038198 for corresponding x. - Lekraj Beedassy, Sep 07 2004
Also numbers such that 2^(n-3)-1 is in A000217, i.e., a triangular number. - M. F. Hasler, Feb 23 2009
With respect to M. F. Hasler's comment above, all terms 2^(n-3) - 1 are known as the Ramanujan-Nagell triangular numbers (A076046). - Raphie Frank, Mar 31 2013
Interestingly enough, all the solutions correspond to noncomposite x, i.e., x = 1 for the first term, and primes 3, 5, 11, 181 for the following terms. - M. F. Hasler, Mar 11 2024

Examples

			The fifth and ultimate solution to Ramanujan's equation is obtained for the 15th power of 2, so that we have x^2 + 7 = 2^15 yielding x = 181.
		

References

  • J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 181, p. 56, Ellipses, Paris 2008.
  • J. Roberts, Lure of the Integers. pp. 90-91, MAA 1992.
  • Ian Stewart & David Tall, Algebraic Number Theory and Fermat's Last Theorem, 3rd Ed. Natick, Massachusetts (2002): 96-98.

Crossrefs

Programs

Formula

a(n) = log_2(8*A076046(n) + 8) = log_2(A227078(n) + 7)
Empirically, a(n) = Fibonacci(c + 1) + 2 = ceiling[e^((c - 1)/2)] + 2 where {c} is the complete set of positive solutions to {n in N | 2 cos(2*Pi/n) is in Z}; c is in {1,2,3,4,6} (see A217290).

Extensions

Added keyword "full", M. F. Hasler, Feb 23 2009

A242963 Numbers n such that A242962(n) = sigma(n) = A000203(n).

Original entry on oeis.org

5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71
Offset: 1

Views

Author

Jaroslav Krizek, May 29 2014

Keywords

Comments

A242962(n) = (n*(n+1)/2) mod antisigma(n) = A000217(n) mod A024816(n).
Union of number 5 and numbers >= 7.
Conjecture: this sequence lists all the positive integers n such that, for some integer k, (sin(k*Pi/n))^2 is irrational. - Lorenzo Sauras Altuzarra, Jan 27 2020

Crossrefs

Programs

  • Magma
    [n: n in [3..100000] | ((n*(n+1)div 2) mod (n*(n+1)div 2-SumOfDivisors(n))) eq (SumOfDivisors(n))]
  • Mathematica
    Select[Range[3, 71], DivisorSigma[1, #] == Mod[PolygonalNumber@ #, Total@ Complement[Range@ #, Divisors@ #]] &] (* Michael De Vlieger, Jan 28 2020 *)

A218129 2^(((c - 2)^2 + (c - 2))/2) + n = a(n), where c are the positive solutions to {y in N | 2*cos(2*Pi/y) is in Z}; c = {1,2,3,4,6}.

Original entry on oeis.org

1, 2, 4, 11, 1028
Offset: 0

Views

Author

Raphie Frank, Oct 21 2012

Keywords

Comments

The set {c} consists of the complete set of positive solutions to the short proof of the Crystallographic Restriction Theorem {1, 2, 3, 4, 6} (see A217290).
Let {V} = prime(a(n)) = {2, 3, 7, 31, 8191}. Then all elements of {V} follow form x^2 + x + 1 for some x in R; x = {(sqrt(5) - 1)/2, 1, 2, 5, 90}. (V + V(mod 2) - 2)/2 gives the complete set of Ramanujan-Nagell triangular numbers (A076046) = {0, 1, 3, 15, 4095} == (2^F_(c + 1) - 2)/2 (see A215929); F_n the n-th Fibonacci number (A000045).
Additionally, 2*V - 1 = {3, 5, 13, 61, 16381} is prime and, therefore, all elements of {V} are links in a Cunningham chain of the 2nd kind (see A005382).

Examples

			2^(((1 - 2)^2 + (1 - 2))/2) + 0 = 2^(a(-1) - 1) + 0 = 1 = a(0).
2^(((2 - 2)^2 + (2 - 2))/2) + 1 = 2^(a(0) - 1) + 1 = 2 = a(1).
2^(((3 - 2)^2 + (3 - 2))/2) + 2 = 2^(a(1) - 1) + 2 = 4 = a(2).
2^(((4 - 2)^2 + (4 - 2))/2) + 3 = 2^(a(2) - 1) + 3 = 11 = a(3).
2^(((6 - 2)^2 + (6 - 2))/2) + 4 = 2^(a(3) - 1) + 4 = 1028 = a(4).
		

Crossrefs

Formula

to n = 4, then a(n) = 2^(a(n - 1) - 1) + n; a(-1) = 1.
Showing 1-3 of 3 results.