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.

A173257 Pell sequence entry points for primes == 1 (mod 4).

This page as a plain text file.
%I A173257 #28 Jan 05 2025 19:51:39
%S A173257 3,7,8,5,19,10,27,31,36,44,48,51,55,28,17,75,79,87,91,96,9,23,116,40,
%T A173257 64,15,139,140,49,78,159,28,175,22,187,39,199,200,102,211,216,224,114,
%U A173257 231,255,65,271,279,71,16
%N A173257 Pell sequence entry points for primes == 1 (mod 4).
%H A173257 R. J. Mathar, <a href="/A173257/b173257.txt">Table of n, a(n) for n = 1..1000</a>
%H A173257 Neville Robbins, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/22-4.html">On Pell numbers of the form p*X^2, where p is prime</a>, Fib Quart. 22 (4) (1984) 340, Table 2.
%F A173257 a(n) = A214028(A002144(n)).
%p A173257 A173257 := proc(n)
%p A173257         A214028(A002144(n)) ;
%p A173257 end proc:
%p A173257 seq(A173257(n),n=1..50) ;
%K A173257 nonn,easy
%O A173257 1,1
%A A173257 _R. J. Mathar_, Jul 07 2012