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 A138693 #17 Sep 14 2014 11:24:37
%S A138693 114,119,135,159,231,279,399,471,639,951,1071,1479,1791,1959,2319,
%T A138693 2919,3591,3831,4599,5151,5439,6351,6999,8031,9519,10311,10719,11559,
%U A138693 11991,12879,16239,17271,18879,19431,22311,22911,24759,26679,27999,30039
%N A138693 Numbers of the form 110 + p^2. (where p is a prime).
%C A138693 110+p^2 is divisible by 3, for any prime p>3. - _M. F. Hasler_
%F A138693 a(n) = 110 + A000040(n)^2. - _Wesley Ivan Hurt_, Sep 13 2014
%F A138693 a(n) = 110 + A001248(n). - _Michel Marcus_, Sep 14 2014
%p A138693 A138693:=n->110+ithprime(n)^2: seq(A138693(n), n=1..50); # _Wesley Ivan Hurt_, Sep 13 2014
%t A138693 Table[2*55 + Prime[p + 1]^2, {p, 0, 100}]
%t A138693 #^2+110&/@Prime[Range[40]] (* _Harvey P. Dale_, Jan 21 2012 *)
%o A138693 (PARI) a(n) = 110 + prime(n)^2; \\ _Michel Marcus_, Sep 14 2014
%Y A138693 Cf. A000040, A138479, A138685, A138686, A138691, A138692, A138693, A138694, A007528, A138696, A138697, A138698, A138699, A138700.
%K A138693 nonn,easy,less
%O A138693 1,1
%A A138693 _Artur Jasinski_, Mar 26 2008