cp's OEIS Frontend

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.

A125218 Numbers having at least two representations as 4*x*y-x-y with 1<=x<=y.

This page as a plain text file.
%I A125218 #11 Jul 13 2013 12:03:27
%S A125218 26,41,47,56,68,71,74,86,89,96,101,107,110,116,128,131,140,146,152,
%T A125218 155,161,166,173,176,182,185,191,194,201,206,209,215,221,224,236,239,
%U A125218 242,250
%N A125218 Numbers having at least two representations as 4*x*y-x-y with 1<=x<=y.
%C A125218 A125203(a(n)) > 1.
%C A125218 A124934 is the union of this sequence and A125217.
%H A125218 Reinhard Zumkeller, <a href="/A125218/b125218.txt">Table of n, a(n) for n = 1..10000</a>
%o A125218 (Haskell)
%o A125218 import Data.List (findIndices)
%o A125218 a125218 n = a125218_list !! (n-1)
%o A125218 a125218_list = map (+ 1) $ findIndices (> 1) a125203_list
%o A125218 -- _Reinhard Zumkeller_, Jan 02 2013
%K A125218 nonn
%O A125218 1,1
%A A125218 _Reinhard Zumkeller_, Nov 24 2006