Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157460
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157460 The n(j) solutions of the 2 equations problem : 5*n(j)+1 = a(j)A^2 ; 6*n(j)+1 = b(j)A^2 ; with n(j), a(j), b(j) positive integer elements. +0
1
0, 88, 42504, 20486928, 9874656880, 4759564129320, 2294100035675448 (list; graph; listen)
OFFSET

1,2

FORMULA

The a(j) recurrence is a(1)=1 ; a(2)=21 ; a(t+2)=22*a(t+1)-a(t) ;

resulting in a(j) terms A157014

The b(j) recurrence is b(1)=1 ; b(2)=23; b(t+2)=22*b(t+1)-b(t);

resulting in b(j) terms A133283

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

resulting in n(j) terms 0, 88, 42504, 20486928, 9874656880 as listed above

CROSSREFS

A157014

Sequence in context: A052069 A048919 A159718 this_sequence A093244 A079036 A159420

Adjacent sequences: A157457 A157458 A157459 this_sequence A157461 A157462 A157463

KEYWORD

nonn

AUTHOR

Paul Weisenhorn (paulweisenhorn(AT)online.de), Mar 01 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research