30020

Appears in sequences

• Mixed partitions of n.at n=38A002096
• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 10.at n=18A022315
• T(4n,n), where T is the array defined in A026105.at n=5A026114
• Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.at n=26A071153
• Łukasiewicz words that are also valid asynchronic siteswap juggling patterns.at n=18A071160
• Integers whose decimal expansion satisfies the condition that if we read each term from the left to right (the most significant to the least significant digit) then each nonzero digit gives a distance to the next nonzero digit to right (with a cyclic wrap-over from the least-significant to the most significant nonzero digit).at n=29A071161
• Members of 3-cycles of permutation A111273.at n=29A113701
• a(1) = 1; thereafter, a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any three consecutive digits in the sequence sum up to a prime.at n=44A152603
• a(n) = 1000*n + 20.at n=29A157510
• "Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t".at n=23A284515