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.

A226603 Let c(n) be the n-th number in the sequence of odd composite numbers that are not squares of primes, and let p = c(n)*2^k + 1 (with k > 0) and m be the smallest integer satisfying congruence 2^m == 1 (mod p). The number a(n) is the least k such that p is prime and c(n) does not divide m, or 0 if no such value exists.

Table of values

n a(n)
1 1
2 1
3 2
4 6
5 13
6 2
7 9
8 13
9 2744
10 2
11 1
12 93
13 2
14 1
15 19
16 15
17 6
18 6
19 168
20 6
21 13
22 2
23 5
24 1
25 26
26 91
27 3
28 6
29 1
30 5
31 10
32 18
33 1
34 293
35 250
36 11
37 1
38 41
39 30
40 5
41 1
42 8
43 16
44 4
45 2
46 497
47 176316
48 95
49 4
50 592
51 65
52 6
53 3
54 113
55 36
56 1

List of values

[1, 1, 2, 6, 13, 2, 9, 13, 2744, 2, 1, 93, 2, 1, 19, 15, 6, 6, 168, 6, 13, 2, 5, 1, 26, 91, 3, 6, 1, 5, 10, 18, 1, 293, 250, 11, 1, 41, 30, 5, 1, 8, 16, 4, 2, 497, 176316, 95, 4, 592, 65, 6, 3, 113, 36, 1]

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

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