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.

A111421 a(n) = n-th decimal digit + 1 of the fractional part formed by the square root of the n-th prime.

This page as a plain text file.
%I A111421 #14 Feb 22 2024 15:12:43
%S A111421 5,4,7,8,3,2,7,5,4,2,4,9,9,1,5,3,8,5,0,4,2,5,3,1,5,2,9,7,5,0,9,9,2,5,
%T A111421 4,5,1,9,5,2,1,3,9,7,4,3,4,8,5,8,7,7,3,6,1,2,3,4,2,4,8,5,5,8,8,5,4,7,
%U A111421 0,7,2,3,2,0,9,0,5,3,0,0,4,6,7,0,1,5,0,4,9,7,0,7,4,7,5,3,7,4,6,0,4,8,9,0,7
%N A111421 a(n) = n-th decimal digit + 1 of the fractional part formed by the square root of the n-th prime.
%C A111421 Also a Cantor diagonal proving the irrational numbers are a non-denumerable infinite set. Also A071901(n)+ 1.
%D A111421 John D. Barrow, The Infinite Book, Pantheon Book New York 2005, pp. 69-76.
%e A111421 The 2nd prime is 3. Sqrt(3) = 1.7320508..., The 2nd entry after the decimal point is 3 and 3+1=4, the 2nd entry in the table.
%t A111421 f[n_] := Block[{rd = RealDigits[ Sqrt@Prime@n, 10, 111]}, Mod[rd[[1, n + rd[[2]]]] + 1, 10]]; Array[f, 105] (* _Robert G. Wilson v_, Nov 17 2005 *)
%o A111421 (PARI) a(n) = localprec(n+1); (floor(frac(sqrt(prime(n)))*10^n)+1) % 10; \\ _Michel Marcus_, Feb 22 2024
%Y A111421 Cf. A071901.
%K A111421 easy,nonn,base
%O A111421 2,1
%A A111421 _Cino Hilliard_, Nov 12 2005
%E A111421 More terms from _Robert G. Wilson v_, Nov 17 2005