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 A243769 #10 Jun 14 2014 13:28:21 %S A243769 3,1,23,18,17,147,181,59,577,864,577,724,471,1797,1595,1757,1799,461, %T A243769 63,4246,2427,2114,601,8215,9613,7863,4279,1743,10107,7652,14673, %U A243769 11336,9671,3132,4883,21177,19229,16745,10683,6961,2599,25966,30141,18202,9415,37803,1201,6538,48203,31851,19757,11819,53711,59088,51463,42892,33339,10016,78493,61693,36487,39717 %N A243769 a(n) = prime(n)^3 mod (n^2 + prime(n)^2). %C A243769 Remark: The sequence (n^2+prime(n)^2) mod prime(n)^2 is A000290 and the sequence (n^2+prime(n)^2) mod n^2 is A001248. %H A243769 Freimut Marschner, <a href="/A243769/b243769.txt">Table of n, a(n) for n = 1..9592</a> %F A243769 a(n) = A030078(n) mod A106587(n). %e A243769 prime(4) = 7, 7^3 = 343, 4^2 + 7^2 = 65, 343 mod 65 = 18. %Y A243769 Cf. A030078 (prime(n)^3), A106587 (n^2 + prime(n)^2). %Y A243769 Cf. A000290 (n^2), A001248 (prime(n)^2). %K A243769 nonn %O A243769 1,1 %A A243769 _Freimut Marschner_, Jun 10 2014