<filename>code/golombs_selfdescribing_sequence/sol_341.py

# -*- coding: utf-8 -*-
'''
    File name: code\golombs_selfdescribing_sequence\sol_341.py
    Author: <NAME>
    Date created: Oct 20, 2018
    Python Version: 3.x
'''

# Solution to Project Euler Problem #341 :: Golomb's self-describing sequence
# 
# For more information see:
# https://projecteuler.net/problem=341

# Problem Statement 
'''
The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are


n123456789101112131415…G(n)122334445556666…

You are given that G(103) = 86, G(106) = 6137.
You are also given that ΣG(n3) = 153506976 for 1 ≤ n < 103.

Find ΣG(n3) for 1 ≤ n < 106.
'''

# Solution 

# Solution Approach 
'''
'''

<filename>code/golombs_selfdescribing_sequence/sol_341.py

# -*- coding: utf-8 -*-
'''
    File name: code\golombs_selfdescribing_sequence\sol_341.py
    Author: <NAME>
    Date created: Oct 20, 2018
    Python Version: 3.x
'''

# Solution to Project Euler Problem #341 :: Golomb's self-describing sequence
# 
# For more information see:
# https://projecteuler.net/problem=341

# Problem Statement 
'''
The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are


n123456789101112131415…G(n)122334445556666…

You are given that G(103) = 86, G(106) = 6137.
You are also given that ΣG(n3) = 153506976 for 1 ≤ n < 103.

Find ΣG(n3) for 1 ≤ n < 106.
'''

# Solution 

# Solution Approach 
'''
'''

# -*- coding: utf-8 -*- File name: code\golombs_selfdescribing_sequence\sol_341.py     Author: <NAME>     Date created: Oct 20, 2018     Python Version: 3.x # Solution to Project Euler Problem #341 :: Golomb's self-describing sequence # # For more information see: # https://projecteuler.net/problem=341 # Problem Statement The Golomb's self-describing sequence {G(n)} is the only nondecreasing sequence of natural numbers such that n appears exactly G(n) times in the sequence. The values of G(n) for the first few n are   n123456789101112131415…G(n)122334445556666…  You are given that G(103) = 86, G(106) = 6137. You are also given that ΣG(n3) = 153506976 for 1 ≤ n < 103.  Find ΣG(n3) for 1 ≤ n < 106. # Solution # Solution Approach