Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001184
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A001184
%S A001184 1,2,104,111712,2688307514,1445778936756068,17337631013706758184626
%N A001184 Number of simple Hamiltonian rook paths connecting opposite corners of 
               2n+1 X 2n+1 board.
%D A001184 Computed by D. E. Knuth, Dec. 7, 1995.
%Y A001184 a(n)=A121788(2n), n>0. [From Ashutosh Mehra (ashutoshmehra(AT)gmail.com), 
               Dec 19 2008]
%Y A001184 Sequence in context: A055693 A106299 A101530 this_sequence A098653 A119433 
               A042351
%Y A001184 Adjacent sequences: A001181 A001182 A001183 this_sequence A001185 A001186 
               A001187
%K A001184 nonn,walk
%O A001184 0,2
%A A001184 D. E. Knuth

    
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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research