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.

A355483 a(1) = 1; for n > 1, a(n) is the smallest positive number that has not yet appeared such that the number of 1-bits in the binary expansion of a(n) equals the number of divisors of a(n-1).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 15
7 23
8 9
9 7
10 10
11 27
12 29
13 12
14 63
15 95
16 30
17 255
18 383
19 17
20 18
21 111
22 39
23 43
24 20
25 119
26 45
27 123
28 46
29 51
30 53
31 24
32 447
33 54
34 479
35 33
36 57
37 58
38 60
39 4095
40 16777215
41 79228162514264337593543950335

List of values

[1, 2, 3, 5, 6, 15, 23, 9, 7, 10, 27, 29, 12, 63, 95, 30, 255, 383, 17, 18, 111, 39, 43, 20, 119, 45, 123, 46, 51, 53, 24, 447, 54, 479, 33, 57, 58, 60, 4095, 16777215, 79228162514264337593543950335]