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.

A218386 a(n) = A215929(n) - (-1)^Fibonacci(n+1)*A218086(n).

Original entry on oeis.org

2, 5, 19, 257, 196687
Offset: 0

Views

Author

Raphie Frank, Oct 27 2012

Keywords

Crossrefs

Cf. A215929, A218086.

A218086 Mersenne prime exponents of prime index equal to 1 or another Mersenne prime exponent.

Original entry on oeis.org

2, 3, 5, 17, 127
Offset: 1

Views

Author

Raphie Frank, Oct 20 2012

Keywords

Comments

No others < 24036584 (see A000043, Mersenne exponents).
More formally: {n in N | 0 < d(2^n - 1) < 3 and 0 < d(2^Pi(n) - 1) < 3}; d(n) the divisor count function and Pi(n) the prime counting function.
To n = 4, this sequence = |A218386(n) - A215929(n)| = |{2, 5, 19, 257, 196687} - {0, 2, 24, 240, 196560}|
Conjecture: This sequence is complete.

Examples

			Pi(2) = 1
Pi(3) = 2
Pi(5) = 3
Pi(17) = 7
Pi(127) = 31
{2, 3, 5, 17, 127} are Mersenne prime exponents.
{1, 2, 3, 7, 31} are Mersenne prime exponents at the beginning of the 20th century. (see A008578, noncomposite numbers)

Crossrefs

Cf. A218386, A215929

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).

Links

Crossrefs

Cf. A217290, A215929, A076046.

Formula

to n = 4, then a(n) = 2^(a(n - 1) - 1) + n; a(-1) = 1.
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.