40081

Appears in sequences

• Crystal ball sequence for 6-dimensional cubic lattice.at n=8A001848
• Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=29A006145
• Crystal ball sequence for 8-dimensional cubic lattice.at n=6A008417
• Numbers n such that prime(n) mod n <= 10.at n=55A022465
• Numbers k such that prime(k) == 7 (mod k).at n=11A023149
• a(n) = T(n,n+2), where T = Delannoy triangle (A008288).at n=6A026002
• Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=26A064675
• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k returns (i.e., down steps hitting the x-axis).at n=57A097612
• Number of solutions to x*frac[p(x)/x]<=Log[n] or A004648(n)<=Log[n].at n=30A099641
• A symmetric number triangle based on 2^n.at n=31A108477
• A symmetric number triangle based on 2^n.at n=32A108477
• Number triangle, equal to half of Delannoy square array A008288.at n=38A113139
• Riordan array (1/(1-x), x*(1+x)^2/(1-x)^2).at n=59A114123
• 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, 0), (-1, 1, 0), (0, 1, -1), (1, 0, 0)}.at n=11A148512
• Number triangle T(n,k) = [k<=n]*Hypergeometric2F1([-k, 2k-2n], [1], 2).at n=61A184883
• Irregular triangle read by rows formed by taking every other row of the Delannoy array (A008288) regarded as a triangle.at n=55A297191
• Irregular triangle read by rows formed by taking every other row of the Delannoy array (A008288) regarded as a triangle.at n=57A297191
• Left-hand half of triangle A297191.at n=34A297192
• Number of integer partitions of n whose length is a semi-sum of the parts.at n=45A367394
• Irregular triangle read by rows: T(n,k) is the number of k-crossing partitions on 2n nodes, where all partition terms alternate in parity, counted up to reflection.at n=52A368054