login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354713 Number of solutions (n, D) for Pell equation n^2 - D*y^2 = 1 with fixed n. 0

%I #32 Jun 06 2022 08:05:40

%S 1,2,1,2,1,3,2,3,2,2,1,2,1,3,1,6,1,4,1,2,1,3,2,3,4,2,2,2,1,4,1,4,1,4,

%T 1,4,1,3,1,3,1,2,2,2,2,3,2,6,2,4,1,4,1,6,1,3,1,2,1,2,2,4,2,4,1,2,1,2,

%U 1,6,1,6,2,2,2,2,1,3,3,3,3,2,1,2

%N Number of solutions (n, D) for Pell equation n^2 - D*y^2 = 1 with fixed n.

%C a(n) can be computed as the number of divisors of the square root of the largest square dividing n^2 - 1.

%C A067874 gives n with a(n) = 1.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PellEquation.html">Pell Equation</a>.

%F a(n) = A000005(A000188(n^2-1)).

%e a(17) = 6 because there are 6 possible solutions to 17^2 - D*y^2 = 1: 17^2 - 2*12^2 = 1, 17^2 - 8*6^2 = 1, 17^2 - 18*4^2 = 1, 17^2 - 32*3^2 = 1, 17^2 - 72*2^2 = 1 and 17^2 - 288*1^2 = 1. D = 18 is the smallest of the 6 D values, where the (17,y) pair is minimal and hence A033314(17) = 18.

%t squarefreepart[n_] := Times @@ Power @@@ ({#[[1]], Mod[#[[2]], 2]} & /@ FactorInteger[n]);

%t a[n_] := Divisors[Sqrt[(n^2 - 1)/squarefreepart[n^2 - 1]]] // Length; Table[a[n], {n, 2, 85}]

%o (PARI) f(n) = sqrtint(n/core(n)) \\ A000188

%o a(n) = numdiv(f(n^2-1)); \\ _Michel Marcus_, Jun 05 2022

%Y Cf. A002349, A002350, A033314, A067874.

%K nonn

%O 2,2

%A _Herbert Kociemba_, Jun 04 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 06:47 EDT 2024. Contains 372432 sequences. (Running on oeis4.)