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 A282552 #10 Feb 27 2017 02:33:56
%S A282552 4,16,18,100,144,128,324,242,784,150,1296,800,588,1058,2704,3364,3600,
%T A282552 4356,2450,648,3042,6724,968,4608,10000,5202,11236,3888,3136,882,
%U A282552 16900,9248,19044,21904,2250,8112,26244,13778,29584,31684,32400,18050,18432,38416
%N A282552 Difference between the multiplicative orders of 2 modulo p^2 and 2 modulo p, where p = prime(n).
%C A282552 a(n) = 0 iff A014664(n) = A243905(n), i.e., iff prime(n) is a Wieferich prime (A001220). So far this is known to be the case only for prime(183) = 1093 and prime(490) = 3511, i.e., a(183) = 0 and a(490) = 0.
%F A282552 a(n) = A243905(n) - A014664(n).
%t A282552 Table[MultiplicativeOrder[2, #^2] - MultiplicativeOrder[2, #] &@ Prime@ n, {n, 2, 45}] (* _Michael De Vlieger_, Feb 18 2017 *)
%o A282552 (PARI) a(n) = my(p=prime(n)); znorder(Mod(2, p^2)) - znorder(Mod(2, p))
%Y A282552 Cf. A001220, A014664, A243905.
%K A282552 nonn
%O A282552 2,1
%A A282552 _Felix Fröhlich_, Feb 18 2017