OFFSET
1,1
COMMENTS
Sequence of corresponding m's begins: 30, 36, 1980, 2268, 11658, 16770, 3990, 900, 14490, 54540, ...
Conjectures:
1. The sequence is infinite.
2. There is only one m for each n (this is true for n < 2^26).
LINKS
Kevin P. Thompson, Table of n, a(n) for n = 1..77
PROG
(Java)
public class A224954 {
public static long sr0 = 1;
public static boolean[] Oblong = new boolean[1 << 27];
public static boolean isOblong(long a) {
long b, s, sr = sr0;
while (a < sr*(sr+1)) sr>>=1;
b = sr>>1;
while (b!=0) {
s = sr+b;
if (a >= s*(s+1)) sr = s;
b>>=1;
}
if (a == sr*(sr+1)) return true;
return false;
}
public static void main (String[] args) {
for (int i = 0; i*(i+1) < (1 << 27); ++i) Oblong[i*(i+1)] = true;
for (long a = 0; a < (1 << 26); a+=2) {
long s = 1L << 30, obn = 0, count = 0, lastB = 0;
while (a*a < s*(s+1)) s>>=1;
sr0 = s;
for (long i = 2; obn < a; i+=2) {
long b = a - obn;
if (Oblong[(int)(a*2-obn)])
if (isOblong(a*(a-obn))) { ++count; lastB = b; }
obn += i;
}
if (count!=0) System.out.printf("\n%d %d %d ", a, lastB, count);
if ((a & 0x3fff)==0) System.out.printf(".");
}
}
}
CROSSREFS
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Apr 20 2013
STATUS
approved