Search: id:A094392
Results 1-1 of 1 results found.

%I A094392
%S A094392 1,1,1,1,1,2,1,1,1,3,1,1,1,1,5,1,1,1,1,2,8,1,1,1,1,1,3,13,1,1,1,1,1,1,
               5,
%T A094392 21,1,1,1,1,1,1,2,7,34,1,1,1,1,1,1,1,3,11,55,1,1,1,1,1,1,1,1,5,16,891,
               1,
%U A094392 1,1,1,1,1,1,2,7,25,144,1,1,1,1,1,1,1,1,1,3,11,37,233,1,1,1,1,1,1,1,1,
               1
%N A094392 Antidiagonals of the tables formed from b(m,2,n,n), which is defined 
               in the reference.
%C A094392 This sequence can be used to help find an extension for A006209.
%D A094392 B.-S. Du, A simple method which generates infinitely many congruence 
               indentities, Fib. Quart., 27 (1989), 116-124.
%F A094392 For i=2 and k >= 1 b(k+2, 2, n, n)=b(k, 2, 1, n) + b(k+1, 2, n, n). The 
               remaining portion for the recurrence is defined in the reference.
%e A094392 E.g. for m = 5 and n = 2, b(5,2,2,2)= b(3,2,1,2) + b(4,2,2,2)= 2 because 
               of the definition in the reference.
%e A094392 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 5 2 1 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 8 3 1 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 13 5 2 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 21 7 3 1 1 1 1 1 1 1 1 1 1 1 1
%e A094392 34 11 5 2 1 1 1 1 1 1 1 1 1 1 1
%e A094392 55 16 7 3 1 1 1 1 1 1 1 1 1 1 1
%e A094392 89 25 11 5 2 1 1 1 1 1 1 1 1 1 1
%e A094392 144 37 15 7 3 1 1 1 1 1 1 1 1 1 1
%e A094392 233 57 23 11 5 2 1 1 1 1 1 1 1 1 1
%e A094392 377 85 32 15 7 3 1 1 1 1 1 1 1 1 1
%e A094392 610 130 49 23 11 5 2 1 1 1 1 1 1 1 1
%p A094392 b := proc(k,i,j,n) option remember; if k = 1 then if i = 1 then return 
               0; end if; if i = 2 then if j = n then return 1; end if; return 0; 
               end if; end if; if k = 2 then if i = 1 then return 1; end if; if 
               i = 2 then if j = n then return 1; end if; return 0; end if; end 
               if; if j = n then return b(k-2, i, 1, n) + b(k-1, i, n, n); end if; 
               return b(k-2, i, 1, n) + b(k-2, i, j+1, n); end proc; (Deugau)
%Y A094392 Cf. A006209.
%Y A094392 Sequence in context: A107682 A085476 A124944 this_sequence A111946 A137844 
               A079229
%Y A094392 Adjacent sequences: A094389 A094390 A094391 this_sequence A094393 A094394 
               A094395
%K A094392 nonn,tabl
%O A094392 1,6
%A A094392 Amy Robinson (amylou(AT)mchsi.com), Apr 28 2004
%E A094392 Corrected and extended by Chris Deugau (deugaucj(AT)uvic.ca), Dec 19 
               2005

Search completed in 0.001 seconds