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

%I A036238
%S A036238 2,2,2,2,1,2,2,0,0,2,2,6,5,6,2,2,6,4,4,6,2,2,6,3,2,3,6,2,2,6,2,0,0,2,6,
%T A036238 2,2,6,1,9,8,9,1,6,2,2,6,0,8,6,6,8,0,6,2,2,6,12,7,4,3,4,7,12,6,2,2,6,
%U A036238 12,6,2,0,0,2,6,12,6,2,2,6,12,5,0,12,11,12,0,5,12,6,2,2,6,12,4,14,10,8
%N A036238 Triangle of numbers a(r,j) = j*(j+1) mod r+2, r>=1, j=1..r.
%D A036238 U. Dudley, An infinite triangular array, Math. Mag., 60 (1987), p. 328.
%e A036238 2; 2,2; 2,1,2; 2,0,0,2; 2,6,5,6,2; ...
%o A036238 (C:) #include <stdio.h> #include <stdlib.h> #define MAX_ROWS 100 #define 
               USAGE "Usage: 'A036238 num' where num is the last row of the triangle 
               to compute\n" int main(int argc, char *argv[]) { unsigned long i, 
               j, end, ans; if (argc < 2) { fprintf(stderr, USAGE); return EXIT_FAILURE; 
               } end = atoi(argv[1]); end = (end >= MAX_ROWS) ? MAX_ROWS: end; fprintf(stdout, 
               "Values: "); for (i = 1; i <= end; i++) { for (j = 1; j <= i; j++) 
               { ans = j * (j + 1) % (i +2); fprintf(stdout, "%ld,", ans); } } fprintf(stdout, 
               "\n"); return EXIT_SUCCESS; }
%Y A036238 Sequence in context: A037812 A037200 A090044 this_sequence A063982 A055020 
               A052435
%Y A036238 Adjacent sequences: A036235 A036236 A036237 this_sequence A036239 A036240 
               A036241
%K A036238 nonn,easy,tabl
%O A036238 1,1
%A A036238 N. J. A. Sloane (njas(AT)research.att.com).
%E A036238 More terms and C program from Larry Reeves (larryr(AT)acm.org), Mar 31 
               2000

Search completed in 0.001 seconds