Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159664
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159664 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 positiv integer numbers. +0
1
1, 23, 551, 13201, 316273, 7577351, 181540151, 4349386273, 104203730401 (list; graph; listen)
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 as listed above.

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.

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:=[La), a]:Lb:=[op(Lb), b]: Ln:=[op(Ln), n]: end if: end do:

CROSSREFS

A157456

Sequence in context: A136670 A062360 A062511 this_sequence A158631 A098103 A043347

Adjacent sequences: A159661 A159662 A159663 this_sequence A159665 A159666 A159667

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research