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 A054852 #6 Jan 09 2017 14:05:40 %S A054852 1,1425517,488332318973593,2050097572347809756992173309567231025, %T A054852 5692069548203528002388345621912105864448051297181, %U A054852 110119103236279775595641307904376916046305114442231488626999497,8272277679877096985422106245998459573120465051843356628384885298858447202350071888172185613016339661427405 %N A054852 As p runs through the primes == 1 mod 3, sequence gives Bernoulli(2p) - 1/6. %C A054852 This is an integer by a theorem of Rado. %D A054852 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, th. 120. %Y A054852 Cf. A002476. %K A054852 nonn,easy %O A054852 1,2 %A A054852 _N. J. A. Sloane_, May 15 2001