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.

A090525 Least number k such that floor((n^n)/k) is prime, or 0 if no such number exists.

Table of values

n a(n)
2 2
3 2
4 11
5 9
6 11
7 20
8 10
9 42
10 13
11 16
12 57
13 7
14 35
15 41
16 53
17 35
18 171
19 18
20 141
21 45
22 19
23 55
24 212
25 236
26 94
27 265
28 13
29 76
30 26
31 9
32 13
33 21
34 160
35 21
36 21
37 24
38 378
39 100
40 66
41 52
42 75
43 54
44 214
45 6
46 678
47 193
48 137
49 123
50 138
51 59
52 605
53 87
54 165
55 109
56 417
57 403
58 100
59 57
60 778
61 719
62 79
63 12
64 83
65 450

List of values

[2, 2, 11, 9, 11, 20, 10, 42, 13, 16, 57, 7, 35, 41, 53, 35, 171, 18, 141, 45, 19, 55, 212, 236, 94, 265, 13, 76, 26, 9, 13, 21, 160, 21, 21, 24, 378, 100, 66, 52, 75, 54, 214, 6, 678, 193, 137, 123, 138, 59, 605, 87, 165, 109, 417, 403, 100, 57, 778, 719, 79, 12, 83, 450]

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

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