Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159668
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159668 The general form of the recurrences are the a(j), b(j) and n(j) solutions of the 2 equations problem: 13*n(j)+1=a(j)*a(j) and 15*n(j)+1=b(j)*b(j) with positiv integer numbers. +0
3
1, 27, 755, 21113, 590409, 16510339, 461699083, 12911063985, 361048092497 (list; graph; listen)
OFFSET

1,2

FORMULA

The a(j) recurrence is a(1)=1; a(2)=27; a(t+2)=28*a(t+1)-a(t)

resulting in terms 1, 27, 755, 21113 as listed above

The b(j) recurrence is b(1)=1; b(2)=29; b(t+2)=28*b(t+1)-b(t)

resulting in terms 1, 29, 811, 22679.

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

resulting in terms 0, 0, 56, 43848, 34289136.

MAPLE

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

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

CROSSREFS

A157456

Sequence in context: A009971 A046240 A042406 this_sequence A158645 A138979 A159234

Adjacent sequences: A159665 A159666 A159667 this_sequence A159669 A159670 A159671

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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research