login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159677 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 15*n(j)+1=a(j)*a(j) and 17*n(j)+1=b(j)*b(j) with positive integer numbers. 0
0, 64, 65472, 66912384, 68384391040, 69888780730560, 71426265522241344, 72997573474949923072 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

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

MAPLE

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:

CROSSREFS

A157456, A159675

Sequence in context: A103346 A123394 A069445 * A013832 A034989 A187242

Adjacent sequences:  A159674 A159675 A159676 * A159678 A159679 A159680

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.