1,2

The a(j) recurrence is a(1)=1; a(2)=31; a(t+2)=32*a(t+1)-a(t)

resulting in terms 1, 31, 991, 31681

The b(j) recurrence is b(1)=1; b(2)=33; b(t+2)=32*b(t+1)-b(t)

resulting in terms 1, 33, 1055, 33727

The n(j) recurrence is n(0)=n(1)=0; n(2)=64; n(t+3)=1023*(n(t+2)-n(t+1))+n(t)

resulting in terms 0, 0, 64, 65472, 66912384 as listed above

for a from 1 by 2 to 100000 do b:=sqrt((17*a*a-2)/15): if (trunc(b)=b) then

n:=(a*a-1)/15: La:=[op(La), a]:Lb:=[op(Lb), b]:Ln:=[op(Ln), n]: endif: enddo:

A157456, A159675

Sequence in context: A103346 A123394 A069445 this_sequence A013832 A034989 A159410

Adjacent sequences: A159674 A159675 A159676 this_sequence A159678 A159679 A159680

nonn

Paul Weisenhorn (paulweisenhorn(AT)online.de), Apr 19 2009