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.

A034804 Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the third term 'b' of these quadruples.

Table of values

n a(n)
1 0
2 1
3 0
4 2
5 1
6 2
7 4
8 5
9 6
10 14
11 17
12 20
13 48
14 57
15 68
16 162
17 193
18 230
19 548
20 653
21 778
22 1854
23 2209
24 2632
25 6272
26 7473
27 8904
28 21218
29 25281
30 30122
31 71780
32 85525
33 101902
34 242830
35 289329
36 344732
37 821488
38 978793
39 1166220
40 2779074
41 3311233
42 3945294
43 9401540

List of values

[0, 1, 0, 2, 1, 2, 4, 5, 6, 14, 17, 20, 48, 57, 68, 162, 193, 230, 548, 653, 778, 1854, 2209, 2632, 6272, 7473, 8904, 21218, 25281, 30122, 71780, 85525, 101902, 242830, 289329, 344732, 821488, 978793, 1166220, 2779074, 3311233, 3945294, 9401540]