24675

Appears in sequences

• Fibonacci sequence beginning 0, 25.at n=16A022359
• a(n) = binomial(n,4) - binomial(floor(n/2),4) - binomial(ceiling(n/2),4).at n=30A111385
• Numbers of the form 26+p^2 (where p is a prime).at n=36A138689
• Irregular triangle: the coefficient [x^k] of the polynomial (1-x)^(2*n-1) * Sum_{s>=0} A001263(n+2*s,2*s+1)*x^s in row n >= 1 and column k >= 0.at n=39A178657
• Numbers k such that (7*10^(2*k+1) + 9*10^k - 7)/9 is prime.at n=8A183182
• Augmentation of the triangular array P=A094727 given by p(n,k)=n+k+1 for 0<=k<=n. See Comments.at n=20A193093
• Total number of smallest parts that are also emergent parts in all partitions of n with at least one distinct part: a(n) = n + d(n) + p(n-1) + spt(n) - A000070(n) - sigma(n) - 1.at n=43A220483
• Number of compositions [p(1), p(2), ..., p(k)] of n such that p(j) != p(j-2).at n=19A224958
• Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 2.at n=52A240011
• Number of length n 1..(1+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=29A258624
• a(n) = n*(n + 11)*(n + 22)*(n + 33)/24.at n=14A264448
• Numbers k such that 64^k - 8^k - 1 is prime.at n=19A265486
• Smallest b such that the k consecutive primes starting with prime(n) are all base-b Wieferich primes, i.e., satisfy b^(p-1) == 1 (mod p^2). Square array A(n, k), read by antidiagonals downwards.at n=32A286816
• A(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..3, with k running over the positive integers; square array, read by antidiagonals, downwards.at n=14A319061
• a(n) is the smallest b > 1 such that prime(n), prime(n+1), prime(n+2) and prime(n+3) are all base-b Wieferich primes.at n=4A344828
• Lexicographically earliest sequence of nonnegative integers such that two distinct terms differ by at least 4 decimal digits.at n=22A346000