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

A261659 a(n) = sqrt(A261655(n)/144) for n>1.

Original entry on oeis.org

1, 3, 5, 35, 33, 144, 80, 137, 285, 363, 387, 351, 204, 935, 225, 241, 289, 665, 1210, 310, 710, 324, 327, 685, 945, 749, 805, 479, 2091, 1260, 1169, 628, 2156, 654, 2355, 1827, 1545, 2181, 1499, 761, 3126, 1575, 2364, 1770, 1452, 1455, 2827, 1739, 3390, 4641
Offset: 2

Views

Author

Michel Lagneau, Aug 28 2015

Keywords

Comments

The primes of the sequence are 3, 5, 137, 241, 479, 761, 1499, ...
The squares of the sequence are 1, 144, 225, 289, 324, ...

Examples

			a(3)=3 because sqrt(A261655(3)/144) = sqrt(1296/144) = sqrt(9)=3.
		

Crossrefs

Cf. A261655: squares equal to the difference between two successive primes of the form k^2+2.

Programs

  • Maple
    q:=83:for n from 2 to 10^7 do:p:=n^2+2:if isprime(p) then x:=p-q:q:=p: z:=sqrt(x):if z=floor(z) then printf(`%d, `, x/144):else fi:fi:od:
Showing 1-1 of 1 results.