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

A096431 Denominator of (9*(n^4 - 2*n^3 + 2*n^2 - n) + 2)/(2*(2*n - 1)).

Original entry on oeis.org

1, 3, 1, 7, 9, 11, 13, 3, 17, 19, 21, 23, 5, 27, 29, 31, 33, 7, 37, 39, 41, 43, 9, 47, 49, 51, 53, 11, 57, 59, 61, 63, 13, 67, 69, 71, 73, 15, 77, 79, 81, 83, 17, 87, 89, 91, 93, 19, 97, 99, 101, 103, 21, 107, 109, 111, 113, 23, 117, 119, 121, 123, 25, 127, 129, 131, 133
Offset: 1

Views

Author

Eric W. Weisstein, Aug 09 2004

Keywords

Comments

From Altug Alkan, Apr 13 2018: (Start)
Also numerator of (2*n-1)/5.
Proof: Since 9*(n^4-2*n^3+2*n^2-n)+2 = 9*n^4-18*n^3+18*n^2-9*n+2 = (3*n^2-3*n+1)*(3*n^2-3*n+2), this is an even number. So we can see that 9*n^4-18*n^3+18*n^2-9*n+2 = (4*n^3-7*n^2+5*n-2)*(2*n-1) + n^2*(n^2+1) and we should focus on the n^2*(n^2+1)/(2*n-1) part for the denominator, n^2+1 = ((2*n-1)/4)*((2*n+1)+5/(2*n-1)) and n^2*(n^2+1)/(2*n-1) = (n^2/4)*(2*n+1+5/(2*n-1)).
Since gcd(n^2, 2*n-1) = 1 and 4 is always killed by the numerator part independent of denominator of 5/(2*n-1), the denominator of (9*(n^4-2*n^3+2*n^2-n)+2)/(2*(2*n-1)) will always be determined by the denominator of 5/(2*n-1).
In other words, this is the numerator of (2*n-1)/5. (End)

Examples

			1, 28/3, 38, 703/7, 1891/9, 4186/11, ...
		

Crossrefs

Cf. A096430 (numerators), A097361, A146535.

Programs

  • Magma
    A096431:= func< n | Numerator((2*n-1)/5) >; [A096431(n): n in [1..60]]; // G. C. Greubel, Oct 14 2024
    
  • Mathematica
    Table[ (9(n^4-2n^3+2n^2-n)+2)/(2(2n-1)),{n,80}]//Denominator (* or *)
    LinearRecurrence[{0,0,0,0,2,0,0,0,0,-1},{1,3,1,7,9,11,13,3,17,19},80] (* Harvey P. Dale, Aug 25 2021 *)
  • PARI
    a(n) = numerator((2*n-1)/5); \\ Altug Alkan, Apr 13 2018
    
  • PARI
    first(n) = my(res = vector(n, i, 2*i - 1)); forstep(i = 3, n, 5, res[i]/=5); res \\ David A. Corneth, Apr 15 2018
    
  • SageMath
    def A096431(n): return numerator((2*n-1)/5)
    [A096431(n) for n in range(1,61)] # G. C. Greubel, Oct 14 2024

Formula

Satisfies a linear recurrence with characteristic polynomial (1-x^5)^2.
G.f.: x*(1+x)*(1+2*x-x^2+8*x^3+x^4+8*x^5-x^6+2*x^7+x^8)/((1-x)^2*(1+x+x^2+x^3+x^4)^2). - R. J. Mathar, Mar 11 2011

A098649 Primes of the form 2(p+q) + 1, where p and q are consecutive primes.

Original entry on oeis.org

11, 17, 37, 61, 73, 137, 157, 181, 241, 257, 277, 373, 397, 409, 421, 433, 577, 601, 617, 641, 661, 769, 821, 1097, 1117, 1129, 1153, 1201, 1237, 1249, 1297, 1453, 1481, 1597, 1621, 1657, 1861, 1933, 2089, 2129, 2281, 2297, 2417, 2441, 2473, 2749, 2857, 3037
Offset: 1

Views

Author

Giovanni Teofilatto, Sep 18 2004

Keywords

Comments

a(n) == 1 (mod 4), except for the initial term.

Crossrefs

Cf. A097361.

Programs

  • Mathematica
    Select[ Table[2(Prime[i] + Prime[i + 1]) + 1, {i, 150}], PrimeQ[ # ] &] (* Robert G. Wilson v, Sep 19 2004 *)
    Select[2*Total[#]+1&/@Partition[Prime[Range[200]],2,1],PrimeQ] (* Harvey P. Dale, Dec 25 2019 *)

Extensions

More terms from Robert G. Wilson v, Sep 19 2004
Showing 1-2 of 2 results.