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.

A345997 Let m = A344005(n) be the smallest number such that n|m*(m+1); let X = A345992(n) = gcd(n,m); Y = A345993(n) = gcd(n,m+1). Sequence lists n such that neither X nor Y is equal to n/p^k, where p = largest prime divisor of n and k is its exponent in n.

Table of values

n a(n)
1 60
2 70
3 84
4 90
5 120
6 126
7 130
8 154
9 170
10 195
11 198
12 204
13 210
14 220
15 228
16 230
17 234
18 238
19 240
20 252
21 255
22 264
23 273
24 280
25 312
26 315
27 330
28 340
29 348
30 360
31 364
32 370
33 372
34 374
35 378
36 385
37 390
38 396
39 399
40 414
41 418
42 420
43 430
44 434
45 440
46 450
47 455
48 456
49 460
50 462
51 468
52 470

List of values

[60, 70, 84, 90, 120, 126, 130, 154, 170, 195, 198, 204, 210, 220, 228, 230, 234, 238, 240, 252, 255, 264, 273, 280, 312, 315, 330, 340, 348, 360, 364, 370, 372, 374, 378, 385, 390, 396, 399, 414, 418, 420, 430, 434, 440, 450, 455, 456, 460, 462, 468, 470]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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