25662

Appears in sequences

• Quadrinomial coefficients.at n=12A005720
• Fibonacci sequence beginning 0, 26.at n=16A022360
• Rhonda numbers to base 10.at n=14A099542
• Number of 4-almost primes f such that 2^n < f <= 2^(n+1).at n=17A120035
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k cycles that are either nonincreasing or of length 1 (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .at n=49A186759
• Triangle read by rows: T(n,k) is the number of n-tuples with sum k + n whose i-th element is a positive integer <= prime(i), 0 <= k < A070826(n).at n=68A239738
• Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and with no two consecutive increases or two consecutive decreases.at n=9A263664
• Numbers such that the product of their digits is equal to 10 times the sum of their prime factors, without multiplicity.at n=7A306313
• Composites k such that the concatenation of the prime factors of k, with multiplicity, in some order is divisible by k.at n=41A322843
• Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) = number of interior vertices where exactly three lines cross.at n=35A336489
• Maximum second Zagreb index of maximal 3-degenerate graphs with n vertices.at n=45A372025
• Products of 5 distinct primes that are sandwiched between squarefree semiprime numbers.at n=23A376949