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.

A277896 a(n) = the least k > n for which A048675(k) = A048675(n), 0 if no such number exists (when n is a power of 2).

Table of values

n a(n)
1 0
2 0
3 4
4 0
5 9
6 8
7 25
8 0
9 12
10 18
11 49
12 16
13 121
14 50
15 20
16 0
17 169
18 24
19 289
20 27
21 28
22 98
23 361
24 32
25 45
26 242
27 36
28 75
29 529
30 40
31 841
32 0
33 44
34 338
35 63
36 48
37 961
38 578
39 52
40 54
41 1369
42 56
43 1681
44 147
45 60
46 722
47 1849
48 64
49 175
50 90
51 68
52 363
53 2209
54 72
55 99
56 150
57 76
58 1058
59 2809
60 80
61 3481
62 1682
63 84
64 0
65 117
66 88
67 3721
68 507
69 92
70 126
71 4489
72 96
73 5041
74 1922
75 100
76 867
77 275

List of values

[0, 0, 4, 0, 9, 8, 25, 0, 12, 18, 49, 16, 121, 50, 20, 0, 169, 24, 289, 27, 28, 98, 361, 32, 45, 242, 36, 75, 529, 40, 841, 0, 44, 338, 63, 48, 961, 578, 52, 54, 1369, 56, 1681, 147, 60, 722, 1849, 64, 175, 90, 68, 363, 2209, 72, 99, 150, 76, 1058, 2809, 80, 3481, 1682, 84, 0, 117, 88, 3721, 507, 92, 126, 4489, 96, 5041, 1922, 100, 867, 275]