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 A218448 #22 Mar 31 2013 07:56:19
%S A218448 204323,3252571,5205074,7201674,20182921,28387953,36193650,43216722,
%T A218448 51049537,56155074,57070850,61961315,62167075,65425473,76647074,
%U A218448 82507473,92658049,95943321,100498849,107236449,109751473,110899321,112198075,112477849,116736323
%N A218448 First of a run of 5 consecutive numbers with same prime signature.
%C A218448 A number n is in this sequence iff n and n+1 is in A175590; also: iff n and n+2 are in A052214 (in which case n+1 is in A052214, too); and also: iff {n,n+1,n+2,n+3} are in A052213.
%C A218448 A034173(6) = A218448(62) = A218448(63)-1 is the least term n such that n+1 is also in the sequence.
%H A218448 M. F. Hasler and Donovan Johnson, <a href="/A218448/b218448.txt">Table of n, a(n) for n = 1..1000</a> (first 140 terms from _M. F. Hasler_)
%o A218448 (PARI) is_A218448(n)={my(f);!for(i=0,4,f!=(f=vecsort(factor(n+i)[,2])) & i & return)}
%o A218448 (PARI) f(k)=vecsort(factor(k)[,2]~,,4)
%o A218448 t=f(n=2);while(n<1e8, for(i=n+1, n+4, tt=f(i); if(tt!=t, n=i; t=tt; next(2))); print1(n", "); n++) \\ _Charles R Greathouse IV_, Oct 28 2012
%Y A218448 Cf. A034173, A034174, A006558, A083790, A052213, A052214, A175590.
%K A218448 nonn
%O A218448 1,1
%A A218448 _M. F. Hasler_, Oct 28 2012
%E A218448 a(6)-a(8) from _Charles R Greathouse IV_, Oct 28 2012
%E A218448 a(9)-a(25) from _Donovan Johnson_, Oct 28 2012
%E A218448 Values up to a(140) computed using b175590.txt from _Charles R Greathouse IV_ - _M. F. Hasler_, Oct 28 2012