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 A269840 #21 Mar 17 2016 05:59:01 %S A269840 17,41,59,107,137,179,227,281,347,419,521,569,617,641,659,809,827,857, %T A269840 881,1019,1049,1091,1289,1427,1451,1481,1619,1667,1697,1721,1787,1931, %U A269840 2027,2081,2129,2267,2339,2657,2729,2801,2969,3251,3257,3299,3329,3371,3467,3539 %N A269840 Lesser of twin primes where both are the sum of 3 nonzero squares. %H A269840 Chai Wah Wu, <a href="/A269840/b269840.txt">Table of n, a(n) for n = 1..10000</a> %e A269840 17 is a term because 17 = 2^2 + 2^2 + 3^2 and 19 = 1^2 + 3^2 + 3^2. %e A269840 41 is a term because 41 = 3^2 + 4^2 + 4^2 and 43 = 3^2 + 3^2 + 5^2. %e A269840 59 is a term because 59 = 3^2 + 5^2 + 5^2 and 61 = 3^2 + 4^2 + 6^2. %o A269840 (PARI) isA000408(n) = my(a, b) ; a=1 ; while(a^2+1<n, b=1 ; while(b<=a && a^2+b^2<n, if(issquare(n-a^2-b^2), return(1) ) ; b++ ; ) ; a++ ; ) ; return(0) ; %o A269840 t(n,p=3) = { while( p+2 < (p=nextprime( p+1 )) || n-->0, ); p-2} %o A269840 for(n=1, 1e2, if(isA000408(t(n)) && isA000408(t(n)+2), print1(t(n), ", "))); %Y A269840 Cf. A000408, A001359, A085317. %K A269840 nonn %O A269840 1,1 %A A269840 _Altug Alkan_, Mar 13 2016