23902

Appears in sequences

• 2nd level triangle related to Eulerian numbers and binomial transforms (triangle of Eulerian numbers is first level and triangle with Z(0,0)=1 and Z(n,k)=0 otherwise is 0th level).at n=37A062253
• Let u be any string of n digits from {0,1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-2 number; then a(n) = max_u f(u).at n=21A065843
• a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)).at n=11A078455
• a(n) is the number of primes p which have exactly n zeros and n ones when written in binary.at n=10A095018
• Numbers of length n binary words with fewer than 4 0-digits between any pair of consecutive 1-digits.at n=15A145112
• Maximal length of rook tour on an n X n+4 board.at n=30A152135
• Numbers n with property that n^2 is a sum of some 120 successive primes.at n=10A166262
• a(n) = 17*n*(n+1).at n=37A173308
• -2-Knödel numbers.at n=31A225506
• Beastly reciprocals, or numbers k such that digitsum(1/k) = 666.at n=38A244661
• Wiener index of graphs of f.c.c. unit cells in a line = Sum of distances in face-centered cubic grid unit cells connected in a row.at n=8A273322
• Triangle read by rows: T(n,k) = (Eulerian(n+1,k)-binomial(n,k))/2, for 0 <= k <= n.at n=47A290448
• Triangle read by rows: T(n,k) = (Eulerian(n+1,k)-binomial(n,k))/2, for 0 <= k <= n.at n=52A290448
• a(n) = Sum_{k=1..n} k^2 * tau(k)^2, where tau is A000005.at n=15A320897
• Products of four distinct primes between sphenic numbers (products of 3 distinct primes).at n=16A351382