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.

A048612 Find smallest pair (x,y) such that x^2-y^2 = 11...1 (n times) = (10^n-1)/9; sequence gives value of y.

Table of values

n a(n)
1 0
2 5
3 17
4 45
5 115
6 67
7 2205
8 2933
9 166667
10 44445
11 245795
12 6667
13 132683733
14 4444445
15 2012917
16 23767083
17 2680575317
18 666667
19 555555555555555555
20 83053525
21 3263104267
22 12488376483
23 5555555555555555555555
24 66666667
25 2952525627555

List of values

[0, 5, 17, 45, 115, 67, 2205, 2933, 166667, 44445, 245795, 6667, 132683733, 4444445, 2012917, 23767083, 2680575317, 666667, 555555555555555555, 83053525, 3263104267, 12488376483, 5555555555555555555555, 66666667, 2952525627555]