Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

FORMULA

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

resulting in n(j) terms 0, 136, 157080, 181270320, 209185792336, 241400223085560 as listed above

The a(j) recurrence is a(1)=1 ; a(2)=33 ; a(t+2)=34*a(t+1)-a(t) ;

resulting in a(j) terms 1, 33, 1121, 38081, 1293633, ( A077420 )

The b(j) recurrence is b(1)=1 ; b(2)=35; b(t+2)=34*b(t+1)-b(t);

resulting in b(j) terms 1, 35, 1189, 40391, 1372105 ( A046176 )

CROSSREFS

A157014

Sequence in context: A072897 A071231 A035819 this_sequence A001330 A091510 A134885

Adjacent sequences: A157877 A157878 A157879 this_sequence A157881 A157882 A157883

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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research