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.
k denotes the k-th iteration The sequence is initialized with (1, 1) For k = 1 Add a(1) = 1 once, you get (1, 1, 2) For k = 2 Add a(2) = 1 once, you get (1, 1, 2, 3) For k = 3 Add a(3) = 2 twice, you get (1, 1, 2, 3, 5, 7) For k = 4 add a(4) = 3 three times, and you get (1, 1, 2, 3, 5, 7, 10, 13, 16)
def a_list(n):
if n <= 2:
return 1
sequence = [1, 1]
target_number_index = 0
times_to_add = sequence[target_number_index]
for _ in range(n - 2):
if times_to_add == 0:
target_number_index += 1
times_to_add = sequence[target_number_index]
last_term = sequence[-1]
sequence.append(last_term + sequence[target_number_index])
times_to_add -= 1
return sequence
Comments