Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037169
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A037169
%S A037169 2,3,10,28,176,416,2176,4864,23552,178176,380928,2727936,12091392,
%T A037169 25362432,110886912,750256128,5011144704,10362028032,68287463424,
%U A037169 289457307648,595222069248,3864866586624,16242224136192
%N A037169 Prime(n)* Product(prime(n-k) mod prime(n-k-1)); k=0,1...n-2.
%C A037169 If A_n is the n X n matrix a(i,j)=min(prime(i), prime(j)) then det(M_n)/
               det(A_n)=prime(n)/2
%F A037169 Let M_n be the n X n matrix m(i, j)=Max(prime(i), prime(j)); then a(n)=(-1)^(n+1)*det(M_n). 
               - Benoit Cloitre (benoit7848c(AT)orange.fr), May 11 2002
%Y A037169 Sequence in context: A007029 A099435 A140453 this_sequence A058953 A160909 
               A004980
%Y A037169 Adjacent sequences: A037166 A037167 A037168 this_sequence A037170 A037171 
               A037172
%K A037169 easy,nonn
%O A037169 1,1
%A A037169 Armand Turpel (armandt(AT)unforgettable.com)
%E A037169 Corrected and extended by Larry Reeves (larryr(AT)acm.org), Sep 27 2000

    
page 1

Search completed in 0.001 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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research