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.

A134986 a(n) = smallest integer m not equal to n such that n = (floor(n^2/m) + m)/2.

Table of values

n a(n)
1 2
2 3
3 2
4 3
5 4
6 5
7 5
8 6
9 7
10 8
11 9
12 10
13 10
14 11
15 12
16 13
17 14
18 15
19 16
20 17
21 17
22 18
23 19
24 20
25 21
26 22
27 23
28 24
29 25
30 26
31 26
32 27
33 28
34 29
35 30
36 31
37 32
38 33
39 34
40 35
41 36
42 37
43 37
44 38
45 39
46 40
47 41
48 42
49 43
50 44
51 45
52 46
53 47
54 48
55 49
56 50
57 50
58 51
59 52
60 53
61 54
62 55
63 56
64 57
65 58
66 59
67 60
68 61
69 62
70 63
71 64
72 65
73 65

List of values

[2, 3, 2, 3, 4, 5, 5, 6, 7, 8, 9, 10, 10, 11, 12, 13, 14, 15, 16, 17, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 65]

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

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