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.

A260591 a(n) is the number of odd numbers k < 2^n such that A260590(k) = n.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 2
6 0
7 3
8 7
9 0
10 12
11 0
12 30
13 85
14 0
15 173
16 476
17 0
18 961
19 0
20 2652
21 8045
22 0
23 17637
24 51033
25 0
26 108950
27 312455
28 0
29 663535
30 0
31 1900470
32 5936673
33 0
34 13472296
35 39993895
36 0
37 87986917
38 0
39 257978502
40 820236724
41 0
42 1899474678
43 5723030586
44 0
45 12809477536
46 38036848410
47 0
48 84141805077
49 0
50 248369601964

List of values

[0, 1, 0, 1, 2, 0, 3, 7, 0, 12, 0, 30, 85, 0, 173, 476, 0, 961, 0, 2652, 8045, 0, 17637, 51033, 0, 108950, 312455, 0, 663535, 0, 1900470, 5936673, 0, 13472296, 39993895, 0, 87986917, 0, 257978502, 820236724, 0, 1899474678, 5723030586, 0, 12809477536, 38036848410, 0, 84141805077, 0, 248369601964]