Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Feb 11 2024 11:27:46
%S 2,5,8,11,12,14,17,19,20,23,26,29,30,32,33,35,38,40,41,44,47,50,52,53,
%T 54,56,59,61,62,63,65,68,71,74,75,77,80,82,83,85,86,89,90,92,95,96,98,
%U 101,103,104,107,109,110,113,116,117,118,119,122,124,125,128,129,131
%N Numbers of the form 4mn - m - n, where m, n are positive integers.
%C a(n) misses the squares since (2x)^2 + 1 = (4m - 1)(4n - 1) is impossible.
%C a(n) misses the triangular numbers since (2x + 1)^2 + 1 = 2(4m - 1)(4n - 1) is impossible.
%C Taking m = k(k - 1)/2, n = k(k + 1)/2 gives 4mn - m - n = (k^2 - 1)^2 - 1, so a(n) is one less than a square infinitely often.
%C Complement of A094178; A125203(a(n)) > 0; union of A125217 and A125218; range of A125199. - _Reinhard Zumkeller_, Nov 24 2006
%D L. E. Dickson, History of the Theory of Numbers, Vol. II, Diophantine Analysis. Dover Publications, Inc., Mineola, NY, 2005, p. 401.
%H N. Hobson, <a href="/A124934/b124934.txt">Table of n, a(n) for n = 1..1000</a>
%e a(1) = 2 because 2 = 4*1*1 - 1 - 1 is the smallest value in the sequence.
%o (Haskell)
%o import Data.List (findIndices)
%o a124934 n = a124934_list !! (n-1)
%o a124934_list = map (+ 1) $ findIndices (> 0) a125203_list
%o -- _Reinhard Zumkeller_, Jan 02 2013
%Y Cf. A000290, A000217.
%K easy,nonn
%O 1,1
%A _Nick Hobson_, Nov 13 2006
%E More terms from _Reinhard Zumkeller_, Nov 24 2006