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 A217256 #14 May 06 2013 11:23:16 %S A217256 116,186,245,255,275,285,316,356,366,429,604,654,801,861,1066,1076, %T A217256 1086,1106,1146,1166,1246,1266,1396,1406,1426,1436,1446,1506,1516, %U A217256 1526,1556,1586,1606,1626,1636,1676,1686,1756,1786,1796,1826,1846,1866,1886,1916,1946 %N A217256 Triprimes that become squares when their central digit (or central pair of digits) is deleted. %C A217256 In theory, every square number potentially could have 110 triprime representatives through the insertion of 0-9, and 00-99. It appears 25, which is represented by 48 entries in the sequence, holds the record (confirmed for squares < 594441). %C A217256 1600 is the first valid square number (with an even number of digits) not represented in the sequence. %C A217256 104976 is the first valid square number not divisible by 100 with no representatives. %H A217256 Christian N. K. Anderson, <a href="/A217256/b217256.txt">Table of n, a(n) for n = 1..10000</a> %e A217256 a(1)=116 and a(15)=1066 are both triprimes (2*2*29 and 2*13*41 respectively) and become the square number 16 upon deletion. %o A217256 (R)library(gmp); %o A217256 removecentraldigit<-function(x) { s=as.character(x); n=nchar(s); %o A217256 as.bigz(paste(substr(s,1,ifelse(n%%2==0,n/2-1,(n-1)/2)), substr(s,ifelse(n%%2==0,n/2+2,(n+3)/2),n),sep=""))}; %o A217256 istriprime=function(x) ifelse(as.bigz(x)<8,F,length(factorize(x))==3); %o A217256 issquare<-function(x) ifelse(x<2,T,all(table(as.numeric(factorize(x)))%%2==0)) %o A217256 which(sapply(101:1500,function(x) istriprime(x) & issquare(removecentraldigit(x))))+100 %Y A217256 Cf. A014612, A225082, A080603, A000290. %K A217256 nonn,base,less %O A217256 1,1 %A A217256 _Kevin L. Schwartz_ and _Christian N. K. Anderson_, May 03 2013