20110

Appears in sequences

• Number of rooted trees with n nodes and 3 leaves.at n=29A055278
• Interprimes which are of the form s*prime, s=10.at n=38A075285
• Full Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171).at n=13A079436
• Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers.at n=19A169822
• Inverse Euler transform of 2 - A195981.at n=13A206000
• Write A003512(n) in the base {1, 3, 4, 11, 15, 41, 56, 153, 209, ...} (see A002530).at n=9A276387
• Write n in the P-base {1, 3, 4, 11, 15, 41, 56, 153, 209, ...} corresponding to (1+sqrt(3))/2 (see A002530).at n=37A276388
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood.at n=14A283182
• Numbers written in base of double factorial numbers (A006882).at n=34A307102
• List of binary words of lengths 0, 1, 2, etc., including empty word, each prefixed by a 2.at n=21A319953
• Modified Sisyphus function of order 4: a(n) is the concatenation of (number of digits of n)(number digits of n congruent to 0 modulo 4)(number of digits of n congruent to 1 modulo 4)(number of digits of n congruent to 2 modulo 4)(number of digits of n congruent to 3 modulo 4).at n=12A352751
• Modified Sisyphus function of order 4: a(n) is the concatenation of (number of digits of n)(number digits of n congruent to 0 modulo 4)(number of digits of n congruent to 1 modulo 4)(number of digits of n congruent to 2 modulo 4)(number of digits of n congruent to 3 modulo 4).at n=16A352751
• Modified Sisyphus function of order 4: a(n) is the concatenation of (number of digits of n)(number digits of n congruent to 0 modulo 4)(number of digits of n congruent to 1 modulo 4)(number of digits of n congruent to 2 modulo 4)(number of digits of n congruent to 3 modulo 4).at n=21A352751
• Modified Sisyphus function of order 4: a(n) is the concatenation of (number of digits of n)(number digits of n congruent to 0 modulo 4)(number of digits of n congruent to 1 modulo 4)(number of digits of n congruent to 2 modulo 4)(number of digits of n congruent to 3 modulo 4).at n=25A352751
• Modified Sisyphus function of order 4: a(n) is the concatenation of (number of digits of n)(number digits of n congruent to 0 modulo 4)(number of digits of n congruent to 1 modulo 4)(number of digits of n congruent to 2 modulo 4)(number of digits of n congruent to 3 modulo 4).at n=29A352751
• Number of integer partitions of n having at most one permutation with all equal run-lengths.at n=44A383092