cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A082653 For smallest numbers k such that A082596(k) = n, sequence gives A060863(k).

Original entry on oeis.org

2, 30, 910, 15203
Offset: 1

Views

Author

Naohiro Nomoto, May 17 2003

Keywords

Examples

			For n=2; smallest number k = 20, A082596(20) = 2. so a(2) = A060863(20) = 30.
		

Crossrefs

A082661 Numbers n such that A082596(n) = A050221(n), sequence gives A060863(n).

Original entry on oeis.org

2, 4, 52, 70, 95, 100, 124, 153, 169, 177, 201, 230, 252, 261, 272, 273, 275, 314, 316, 322, 377, 378, 384, 434, 450, 451, 507, 517, 527, 657, 702, 711, 720, 833, 884, 896, 904, 910, 930, 1005, 1025, 1047, 1081, 1137, 1189, 1202, 1228, 1351, 1358, 1415
Offset: 1

Views

Author

Naohiro Nomoto, May 18 2003

Keywords

A122820 Array read by rows in which n-th row contains n successive primes with least sum divisible by n.

Original entry on oeis.org

2, 3, 5, 3, 5, 7, 5, 7, 11, 13, 71, 73, 79, 83, 89, 5, 7, 11, 13, 17, 19, 7, 11, 13, 17, 19, 23, 29, 17, 19, 23, 29, 31, 37, 41, 43, 239, 241, 251, 257, 263, 269, 271, 277, 281, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 5, 7, 11, 13, 17
Offset: 1

Views

Author

Ray Chandler, Sep 27 2006

Keywords

Examples

			Triangle begins:
2
3 5
3 5 7
5 7 11 13
71 73 79 83 89
5 7 11 13 17 19
7 11 13 17 19 23 29
17 19 23 29 31 37 41 43
239 241 251 257 263 269 271 277 281
13 17 19 23 29 31 37 41 43 47
29 31 37 41 43 47 53 59 61 67 71
5 7 11 13 17 19 23 29 31 37 41 43
		

Crossrefs

Cf. A054892 (first term of each row), A077388 (row sum), A077389 (row average).

Programs

  • Mathematica
    f[n_] := Block[{k = 1, t},While[t = Table[Prime[i], {i, k, k + n - 1}]; Mod[Plus @@ t, n] > 0, k++ ];t];Flatten[Table[f[n], {n, 12}]]
Showing 1-3 of 3 results.