A034803 - cp's OEIS frontend

A034803 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 second term 'a' of these quadruples.

n	a(n)
1	1
2	0
3	0
4	1
5	0
6	1
7	1
8	2
9	2
10	5
11	6
12	7
13	17
14	20
15	24
16	57
17	68
18	81
19	193
20	230
21	274
22	653
23	778
24	927
25	2209
26	2632
27	3136
28	7473
29	8904
30	10609
31	25281
32	30122
33	35890
34	85525
35	101902
36	121415
37	289329
38	344732
39	410744
40	978793
41	1166220
42	1389537
43	3311233
44	3945294
45	4700770

[1, 0, 0, 1, 0, 1, 1, 2, 2, 5, 6, 7, 17, 20, 24, 57, 68, 81, 193, 230, 274, 653, 778, 927, 2209, 2632, 3136, 7473, 8904, 10609, 25281, 30122, 35890, 85525, 101902, 121415, 289329, 344732, 410744, 978793, 1166220, 1389537, 3311233, 3945294, 4700770]

cp's OEIS Frontend

A034803 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 second term 'a' of these quadruples.

Table of values

List of values