26925

Appears in sequences

• Number of partitions of n such that the number of different parts is odd.at n=41A090794
• Numbers k such that 4*k-1, 8*k-1, 16*k-1 and 32*k-1 are all primes.at n=16A101794
• Triangular matrix, read by rows, equal to [2*I - A008459]^(-1), i.e., the matrix inverse of the difference of twice the identity matrix and the triangular matrix of squared binomial coefficients.at n=16A102220
• Numbers n for which 2n-1, 4n-1, 8n-1, 16n-1 and 32n-1 are primes.at n=3A124017
• Numbers k for which 2*k-1, 4*k-1, 8*k-1 and 16*k-1 are primes.at n=23A124494
• Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 4.at n=51A240013
• Number of generalized fusenes with n decagons.at n=6A259355
• p-INVERT of the Fibonacci sequence (A000045), where p(S) = 1 - S^3.at n=13A292329
• Sum of the eighth largest parts in the partitions of n into 9 parts.at n=50A326466
• Triangle read by rows: T(n,s) is the numerator of the probability that the sum s occurs when repeated rolls of an n-sided die are summed for s = 0..2n.at n=24A365443
• Numbers k such that (k*3^k - 1)/2 is a prime.at n=7A366323
• Consecutive states of the linear congruential pseudo-random number generator for 16-bit WATFOR/WATFIV when started at 1.at n=13A384158