26966

Appears in sequences

• Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=20A061364
• A Binet like formula using the Akiyama-Thurston tile roots for a Minimal Pisot theta0 sequence.at n=37A097600
• A Chebyshev transform of A048739 related to the knot 8_5.at n=15A099854
• Even numbers k such that if a person is born in year k and lives not more than 100 years, then he never celebrates his prime birthday on a prime year.at n=31A124658
• Number of different Othello shapes at the end of the n-th ply.at n=7A125528
• a(n) = the smallest multiple of the n-th prime such that (a(n)+1) is divisible by both the (n-1)th prime and the (n+1)st prime.at n=23A143243
• Numbers n such that sigma(n) + sigma(n+1) = sigma(n+2) + sigma(n+3).at n=7A226475
• Number of paths from (0,1) to (n,0), with vertices (i,k) satisfying 0 <= k <= 3, consisting of segments given by the vectors (1,1), (1,2), (1,-1).at n=18A247354
• On a spirally numbered square grid, with labels starting at 0, this is the number of the final step that a (1,n) leaper makes before getting trapped, or -1 if it never gets trapped.at n=5A323470
• a(n) is the number of Platonic solids in three dimensions with all vertices (x,y,z) in the set {1,2,...,n}^3.at n=12A338791
• Triangle read by rows: T(n,k) is the number of acyclic digraphs on n unlabeled nodes with k arcs and a global source, n >= 1, k = 0..n*(n-1)/2.at n=54A350488
• Integers k equal to the sum over A000203(t) mod t, for some steps, starting with t = k and then using the result to feed the next calculation.at n=41A377001