login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036238 Triangle of numbers a(r,j) = j*(j+1) mod r+2, r>=1, j=1..r. 1
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, 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, 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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

U. Dudley, An infinite triangular array, Math. Mag., 60 (1987), p. 328.

LINKS

Table of n, a(n) for n=1..98.

EXAMPLE

2; 2,2; 2,1,2; 2,0,0,2; 2,6,5,6,2; ...

PROG

(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; }

CROSSREFS

Sequence in context: A175357 A232800 A090044 * A225180 A229895 A063982

Adjacent sequences:  A036235 A036236 A036237 * A036239 A036240 A036241

KEYWORD

nonn,easy,tabl

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms and C program from Larry Reeves (larryr(AT)acm.org), Mar 31 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 1 19:34 EDT 2014. Contains 246317 sequences.