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.

A152936 A vector recursion designed around a row sum of A000165: v(n)=if[odd,{1.n,n^2,...,2^n*n!-Sum2^m,{m,0,n/2-1}],2^n*n!-Sum2^m,{m,0,n/2-1}],...n^2.n,1},{1.n,n^2,...,2^n*n!-2Sum2^m,{m,0,n/2-1}],...n^2.n,1}].

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 6
5 1
6 1
7 23
8 23
9 1
10 1
11 4
12 374
13 4
14 1
15 1
16 5
17 1914
18 1914
19 5
20 1
21 1
22 6
23 36
24 45994
25 36
26 6
27 1
28 1
29 7
30 49
31 322503
32 322503
33 49
34 7
35 1
36 1
37 8
38 64
39 512
40 10320750
41 512
42 64
43 8
44 1
45 1
46 9
47 81
48 729
49 92896460
50 92896460
51 729
52 81
53 9
54 1
55 1
56 10
57 100
58 1000
59 10000
60 3715868978
61 10000

List of values

[1, 1, 1, 1, 6, 1, 1, 23, 23, 1, 1, 4, 374, 4, 1, 1, 5, 1914, 1914, 5, 1, 1, 6, 36, 45994, 36, 6, 1, 1, 7, 49, 322503, 322503, 49, 7, 1, 1, 8, 64, 512, 10320750, 512, 64, 8, 1, 1, 9, 81, 729, 92896460, 92896460, 729, 81, 9, 1, 1, 10, 100, 1000, 10000, 3715868978, 10000]