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.

A191768 G.f. a(x) satisfies: A(x) = 1 + Sum_{n>=1} x^n*A(x)^A000265(n) where A000265(n) = largest odd divisor of n.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 10
5 25
6 68
7 193
8 565
9 1688
10 5136
11 15854
12 49517
13 156191
14 496836
15 1591924
16 5133091
17 16643856
18 54234349
19 177505376
20 583272256
21 1923482331
22 6363842492
23 21117432227
24 70265970878
25 234388421515
26 783664894313
27 2625748635300

List of values

[1, 1, 2, 4, 10, 25, 68, 193, 565, 1688, 5136, 15854, 49517, 156191, 496836, 1591924, 5133091, 16643856, 54234349, 177505376, 583272256, 1923482331, 6363842492, 21117432227, 70265970878, 234388421515, 783664894313, 2625748635300]