<gh_stars>0
# Solution of;
# Project Euler Problem 551: Sum of digits sequence
# https://projecteuler.net/problem=551
# 
# Let a0, a1, a2, . . . be an integer sequence defined by:a0 = 1;for n ≥ 1, an 
# is the sum of the digits of all preceding terms. The sequence starts with 1, 
# 1, 2, 4, 8, 16, 23, 28, 38, 49, . . . You are given a106 = 31054319. Find 
# a1015.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 551
    timed.caller(dummy, n, i, prob_id)

# Solution of;
# Project Euler Problem 551: Sum of digits sequence
# https://projecteuler.net/problem=551
# 
# Let a0, a1, a2, . . . be an integer sequence defined by:a0 = 1;for n ≥ 1, an 
# is the sum of the digits of all preceding terms. The sequence starts with 1, 
# 1, 2, 4, 8, 16, 23, 28, 38, 49, . . . You are given a106 = 31054319. Find 
# a1015.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 551
    timed.caller(dummy, n, i, prob_id)
# Solution of; # Project Euler Problem 551: Sum of digits sequence # https://projecteuler.net/problem=551 # # Let a0, a1, a2, . . . be an integer sequence defined by:a0 = 1;for n ≥ 1, an # is the sum of the digits of all preceding terms. The sequence starts with 1, # 1, 2, 4, 8, 16, 23, 28, 38, 49, . . . You are given a106 = 31054319. Find # a1015. # # by lcsm29 http://github.com/lcsm29/project-euler