This problem is based on, A337517, the most recent OEIS sequence with the keyword "nice". \$a(n)\$ is the number of distinct resistances that can be produced from a circuit with exactly \$n\$ unit resistors. The sequence begins 1, 2, 4, 9, 23, 57, 151, 427, 1263, 3823, 11724, 36048, 110953, 342...

I'd like to see you create code (in any programming language) that output working BF (Brain***k) code. Your program have a single character input on stdin. The input should be one digit ("0", "1", "2", "3", "4", "5", "6", "7", "8" or "9"). Your code should output BF-code that when interpreted wi...

I only want some primes, not all of them It is well known that there are various formulae for calculating primes that span from calculating a subset of primes, to all possible primes. However, for this challenge, I only want a specific subset. You are to write a program which takes a single integ...

Narcissistic loop lengths A narcissistic number is a natural number which is equal to the sum of its digits when each digit is taken to the power of the number digits. For example \$8208 = 8^4 + 2^4 + 0^4 + 8^4\$, so is narcissistic. We'll define a function \$f(n)\$ as the following, for a natura...

Challenge: The challenge is to determine whether or not a given color is one of the colors in the rainbow. When supplied with a color, your program should output a truthy-falsy value indicating whether it is a color of the rainbow, with True equating to it IS a color of the rainbow. Rules/Criteri...

Make a die of given number of faces Objective Given an integer \$n\$ greater than 3, identify an \$n\$-sided die with the "greatest" symmetry, and then decompose \$n\$ to numbers of faces grouped up to the symmetry. Symmetry A die can have one of the following symmetries, from the greatest and wi...