Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157461
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157461 The b(j) solutions of the 2 equations problem : 6*n(j)+1 = a(j)A^2 ; 7*n(j)+1 = b(j)A^2 ; with n(j), a(j), b(j) positive integer elements. +0
1
1, 27, 701, 18199, 472473, 12266099, 318446101 (list; graph; listen)
OFFSET

1,2

FORMULA

The a(j) recurrence is a(1)=1 ; a(2)=25 ; a(t+2)=26*a(t+1)-a(t) ;

resulting in a(j) terms A153111

The b(j) recurrence is b(1)=1 ; b(2)=27; b(t+2)=26*b(t+1)-b(t);

resulting in b(j) terms 1,27,701,18199, 472473, 12266099, 318446101 as listed above

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

resulting in n(j) terms 0, 104, 70200, 47314800, 31890105104

CROSSREFS

A157014

Sequence in context: A113364 A095898 A014914 this_sequence A162827 A163179 A163527

Adjacent sequences: A157458 A157459 A157460 this_sequence A157462 A157463 A157464

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research