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.
%I A100836 #19 Jan 18 2019 01:24:08
%S A100836 2,3,8,7,24,17,48,31,80,49,120,17,168,97,26,127,288,161,360,49,197,
%T A100836 241,528,127,624,337,728,97,840,199,960,511,485,577,99,161,1368,721,
%U A100836 170,351,1680,197,1848,241,649,1057,2208,127,2400,1249,577,337,2808,1457,1451
%N A100836 a(n) is the smallest value k > 1 such that k^2 - 1 is divisible by n^2.
%C A100836 a(n) = n^2 - 1 if n > 1 is in A235868. - _Robert Israel_, Jan 17 2019
%H A100836 Robert Israel, <a href="/A100836/b100836.txt">Table of n, a(n) for n = 1..10000</a> (first 500 terms from Harvey P. Dale)
%e A100836 a(4)=7 because 7^2 - 1 is divisible by 4^2 (and 7 is the smallest integer > 1 that satisfies this criterion).
%p A100836 f:= n -> min(map(t -> rhs(op(t)),{msolve(k^2-1,n^2)}) minus {1}):
%p A100836 f(1):= 2:
%p A100836 map(f, [$1..100]); # _Robert Israel_, Jan 17 2019
%t A100836 With[{c=Range[2,10000]},Flatten[Table[Select[c,Divisible[#^2-1, n^2]&, 1],{n,60}]]] (* _Harvey P. Dale_, Oct 23 2011 *)
%o A100836 (PARI) { A100836(n)=local(f,b,t,m); if(n==1,return(1)); if(n==2,return(3));t=valuation(n,2); if(n==2^t, return(2^(2*t-1)-1)); f=factorint(n/2^t);f=vector(matsize(f)[1],j,f[j,1]^(2*f[j,2])); if(t>0, f=concat(f,[2^(2*t-1)])); b=n^2+1; forvec(v=vector(#f,i,[0,1]), m=lift(chinese(vector(#f,j,Mod((-1)^v[j],f[j])))); if(m>1, b=min(b,m)); ); b } /* _Max Alekseyev_, Nov 21 2008 */
%Y A100836 Cf. A235868.
%K A100836 nonn,look
%O A100836 1,1
%A A100836 Thomas Kerscher (Thomas.Kerscher(AT)web.de), Jan 19 2005
%E A100836 Entries confirmed by _Ray Chandler_, _R. J. Mathar_, and _Max Alekseyev_, Nov 21 2008