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.

A256074 Squares representable as k*m + k + m, where k >= m > 1 are squares.

This page as a plain text file.
%I A256074 #18 Oct 19 2024 22:03:38
%S A256074 49,169,324,441,961,1849,2209,3249,5329,8281,12321,15129,17424,17689,
%T A256074 24649,33489,44521,58081,58564,64009,65025,74529,94249,103684,117649,
%U A256074 145161,177241,191844,214369,237169,257049,305809,361201,423801,480249,494209,573049,660969,700569
%N A256074 Squares representable as k*m + k + m, where k >= m > 1 are squares.
%C A256074 A subsequence of A254671.
%C A256074 The sequence of square roots of a(n) begins: 7, 13, 18, 21, 31, 43, 47, 57, 73, 91, 111, 123, 132, 133, 157, 183, 211, 241, 242, 253, 255, 273, 307, 322, 343.
%C A256074 This sequence is infinite via x = m^2 and y = (m + 1)^2 so then x*y + x + y = m^2 * (m + 1)^2 + m^2 + (m + 1)^2 = m^4 + 2*m^3 + 3*m^2 + 2*m + 1 = (m^2 + m + 1)^2. - _David A. Corneth_, Oct 19 2024
%H A256074 David A. Corneth, <a href="/A256074/b256074.txt">Table of n, a(n) for n = 1..10657</a> (terms <= 10^16)
%e A256074 a(1) = 49 = 4*9 + 4 + 9.
%e A256074 a(2) = 169 = 9*16 + 9 + 16.
%o A256074 (PARI) v=[];for(m=2,100,for(k=m,10^3,if(issquare(s=(k*m)^2+k^2+m^2),v=concat(v,s))));vecsort(v) \\ _Derek Orr_, Mar 21 2015
%Y A256074 Cf. A000290, A058031, A066938, A254671.
%K A256074 nonn
%O A256074 1,1
%A A256074 _Alex Ratushnyak_, Mar 14 2015
%E A256074 More terms from _David A. Corneth_, Oct 19 2024