68022
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of secondary structures of size n having k stacks of length 3.at n=27A202843
- Number of secondary structures of size n having no stacks of length 3.at n=16A202844
- Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k.at n=18A263534
- a(n) = Sum_{k=1..n} phi(k)*phi(k+1)*phi(k+2), where phi(k) = A000010(k) is Euler's totient function.at n=32A335131