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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159665 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 11*n(j)+1=a(j)*a(j) and 13*n(j)+1=b(j)*b(j); with positive integer numbers. 0
0, 48, 27600, 15842400, 9093510048, 5219658925200, 2996075129554800, 1719741904705530048, 987128857225844692800 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

The a(j) recurrence is a(1)=1; a(2)=23; a(t+2)=24*a(t+1)-a(t)

resulting in terms 1, 23, 551, 13201

The b(j) recurrence is b(1)=1; b(2)=25; b(t+2)=24*b(t+1)-b(t)

resulting in terms 1, 25, 599, 14351.

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

resulting in terms 0, 0, 48, 27600, 15842400 as listed above.

MAPLE

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

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

CROSSREFS

A157456

Sequence in context: A123478 A202928 A159425 * A164278 A159441 A011787

Adjacent sequences:  A159662 A159663 A159664 * A159666 A159667 A159668

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 04:18 EST 2012. Contains 205860 sequences.