« first day (48 days earlier)      last day (66 days later) » 

1:13 PM
@Feeds?
 
0
A: One OEIS after another

user202729316. Pascal (FPC), 1808 bytes, A000147 { ''' } Type Num = Integer; // may change this to LongInt or big integer. Const maxN = 1010; // Why using dynamic array? Var ans, i, n, m, n0: Num; a: Array [1..maxN, 1..maxN] of Num; Begin read(n0); inc(n0); // because input is 0-indexing. if n0 >...

 
 
6 hours later…
7:08 PM
0
A: One OEIS after another

NieDzejkob317. Python 3 (Cython), 652 bytes, A001808 from itertools import zip_longest def mul(a, b): return list(map(sum, zip_longest(*[[0] * i + [e * f for j, f in enumerate(b)] for i, e in enumerate(a)], fillvalue = 0))) # a(x) - b(x) def sub(a,b): return list(map(lambda v: v[0] - v[1], zip_longe...

 

« first day (48 days earlier)      last day (66 days later) »