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 A348569 #13 Nov 20 2021 21:10:29
%S A348569 58,125,305,521,953,1313,1961,2833,3757,5317,6553,8081,9593,11425,
%T A348569 14045,16477,19597,21913,24641,27829,30577,35113,40321,45509,50201,
%U A348569 53873,56393,60281,68465,75665,86857,91669,101117,106301
%N A348569 a(n) = (prime(n) + prime(n+2))^2 + prime(n+1)^2.
%C A348569 The square of the shortest distance between the start and end points of the path followed by a person moving 90 degrees left and right (or left and right) at the end of each path on a path of three consecutive prime numbers.
%F A348569 a(n) = prime(n)^2 + prime(n+1)^2 + prime(n+2)^2 + 2*prime(n)*prime(n+2).
%e A348569 For n = 1 the a(1) = (prime(1) + prime(3))^2 + prime(2)^2 = (2 + 5)^2 + 3^2 = 49 + 9 = 58.
%t A348569 Table[(Prime[n] + Prime[n + 2])^2 + Prime[n + 1]^2,{n,34}]
%Y A348569 Cf. A000040, A090076, A133529.
%K A348569 nonn,easy
%O A348569 1,1
%A A348569 _Burak Muslu_, Oct 23 2021