Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157879
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157879 The general form of the recurrences are the a(j) , b(j) and n(j) solutions of the 2 equations problem : 7*n(j)+1 = a(j)*a(j) ; 8*n(j)+1 = b(j)*b(j) ; with n(j), a(j), b(j) positive integer elements. +0
1
0, 120, 107880, 96876240, 86994755760, 78121193796360 (list; graph; listen)
OFFSET

1,2

FORMULA

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

resulting in n(j) terms 0, 120, 107880, 96876240, 86994755760 as listed above

The a(j) recurrence is a(1)=1 ; a(2)=29 ; a(t+2)=30*a(t+1)-a(t) ;

resulting in a(j) terms 1,29, 869, 26041, 780361, 23384789, 700763309

The b(j) recurrence is b(1)=1 ; b(2)=31; b(t+2)=30*b(t+1)-b(t);

resulting in b(j) terms 1, 31, 929, 27839, 834241

CROSSREFS

A157014

Sequence in context: A001421 A107446 A159735 this_sequence A008978 A077692 A068296

Adjacent sequences: A157876 A157877 A157878 this_sequence A157880 A157881 A157882

KEYWORD

nonn

AUTHOR

Paul Weisenhorn (paulweisenhorn(AT)online.de), Mar 08 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