18621

Appears in sequences

• Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8-x^9).at n=31A017822
• Number of 3 X n binary arrays with a path of adjacent 1's from top row to bottom row.at n=4A069361
• Number of n X 5 binary arrays with a path of adjacent 1's from top row to bottom row.at n=2A069380
• Indices m such that A128646(m)-1 is prime, where A128646 = denominator of partial sums of 1/(p(i)-1).at n=45A137689
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 0), (1, 1, -1)}.at n=11A148043
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, -1, 1), (0, 1, -1), (1, 0, 1)}.at n=9A148856
• Numbers with 3 or more prime factors (with multiplicity) such that every concatenation of their prime factors is prime.at n=20A217264
• Number of partitions of n such that least and largest parts are distinct and occur the same number of times.at n=46A265259
• Replacing each digit d in decimal expansion of n with d^2 yields a prime at each step when done recursively three times.at n=23A316604
• Terms k of A228058 such that gcd(k - A048250(k), A162296(k) - k) = A162296(k) - k.at n=29A325376
• Number of ways to write n as an ordered sum of 9 nonprime numbers.at n=23A341486
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with a path of adjacent 1's from top row to bottom row.at n=23A359576
• Array read by antidiagonals: T(m, n) is the number of m X n binary arrays with a path of adjacent 1's from top row to bottom row using only left, right, and downward steps.at n=23A369892
• Odd composites k such that sigma(k) has the same powerful part as k, where sigma is the sum of divisors function.at n=16A386425