A276613 - cp's OEIS frontend

A276613 The infinite trunk of greedy cubes beanstalk: The only infinite sequence such that a(n-1) = a(n) - number of cubes that sum to a(n) with greedy algorithm (A055401).

n	a(n)
0	0
1	7
2	14
3	21
4	26
5	33
6	40
7	47
8	52
9	59
10	63
11	70
12	77
13	84
14	89
15	96
16	103
17	110
18	115
19	124
20	131
21	138
22	145
23	150
24	157
25	164
26	171
27	176
28	183
29	187
30	194
31	201
32	208
33	215
34	222
35	229
36	236
37	241
38	248
39	255
40	262
41	267
42	274
43	278
44	285
45	292
46	299
47	304
48	311
49	318
50	330
51	339
52	342
53	349
54	356
55	363
56	368
57	375
58	382
59	389
60	394
61	401
62	405
63	412
64	419
65	426
66	431
67	438
68	445

[0, 7, 14, 21, 26, 33, 40, 47, 52, 59, 63, 70, 77, 84, 89, 96, 103, 110, 115, 124, 131, 138, 145, 150, 157, 164, 171, 176, 183, 187, 194, 201, 208, 215, 222, 229, 236, 241, 248, 255, 262, 267, 274, 278, 285, 292, 299, 304, 311, 318, 330, 339, 342, 349, 356, 363, 368, 375, 382, 389, 394, 401, 405, 412, 419, 426, 431, 438, 445]

cp's OEIS Frontend

A276613 The infinite trunk of greedy cubes beanstalk: The only infinite sequence such that a(n-1) = a(n) - number of cubes that sum to a(n) with greedy algorithm (A055401).

Table of values

List of values

n	a(n)
0	0
1	7
2	14
3	21
4	26
5	33
6	40
7	47
8	52
9	59
10	63
11	70
12	77
13	84
14	89
15	96
16	103
17	110
18	115
19	124
20	131
21	138
22	145
23	150
24	157
25	164
26	171
27	176
28	183
29	187
30	194
31	201
32	208
33	215
34	222
35	229
36	236
37	241
38	248
39	255
40	262
41	267
42	274
43	278
44	285
45	292
46	299
47	304
48	311
49	318
50	330
51	339
52	342
53	349
54	356
55	363
56	368
57	375
58	382
59	389
60	394
61	401
62	405
63	412
64	419
65	426
66	431
67	438
68	445

n	a(n)
0	0
1	7
2	14
3	21
4	26
5	33
6	40
7	47
8	52
9	59
10	63
11	70
12	77
13	84
14	89
15	96
16	103
17	110
18	115
19	124
20	131
21	138
22	145
23	150
24	157
25	164
26	171
27	176
28	183
29	187
30	194
31	201
32	208
33	215
34	222
35	229
36	236
37	241
38	248
39	255
40	262
41	267
42	274
43	278
44	285
45	292
46	299
47	304
48	311
49	318
50	330
51	339
52	342
53	349
54	356
55	363
56	368
57	375
58	382
59	389
60	394
61	401
62	405
63	412
64	419
65	426
66	431
67	438
68	445

n	a(n)
0	0
1	7
2	14
3	21
4	26
5	33
6	40
7	47
8	52
9	59
10	63
11	70
12	77
13	84
14	89
15	96
16	103
17	110
18	115
19	124
20	131
21	138
22	145
23	150
24	157
25	164
26	171
27	176
28	183
29	187
30	194
31	201
32	208
33	215
34	222
35	229
36	236
37	241
38	248
39	255
40	262
41	267
42	274
43	278
44	285
45	292
46	299
47	304
48	311
49	318
50	330
51	339
52	342
53	349
54	356
55	363
56	368
57	375
58	382
59	389
60	394
61	401
62	405
63	412
64	419
65	426
66	431
67	438
68	445