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 A214321 #13 Jul 13 2013 12:04:28 %S A214321 1,2,3,4,5,6,7,9,11,14,15,17,22,25,28,36,37,38,43,44,47,49,54,57,60, %T A214321 65,70,73,75,78,80,87,105,109,112,115,137,143,147,174,179,180,184,187, %U A214321 206,216,244,253,259,295,301,334,376,393,442,727,933 %N A214321 A214551 sorted and duplicates removed (conjectured). %C A214321 Based on the 10000-term b-file for A214551. But since little is known about A214551, the values beyond 7 are conjectural. For instance, it is only a conjecture that 8 and 10 do not appear in A214551. %C A214321 Based on the first 10^5 terms of A214551 these conjectured values are correct; it seems that there only 1, 4, 8, 25, 29, 33 and 45 occur more than once. - _Reinhard Zumkeller_, Jul 24 2012 %H A214321 Reinhard Zumkeller, <a href="/A214321/b214321.txt">Table of n, a(n) for n = 1..10000, conjectured </a> %o A214321 (Haskell) %o A214321 import Data.Set (fromList, toList, Set) %o A214321 a214321_list_conjectured = toList $ fromList $ take 100000 a214551_list %o A214321 b214321 = bFile' "A214321" (take 10000 a214321_list_conjectured) 1 %o A214321 -- _Reinhard Zumkeller_, Jul 24 2012 %Y A214321 Cf. A214551. %K A214321 nonn %O A214321 1,2 %A A214321 _N. J. A. Sloane_, Jul 22 2012