26508

Appears in sequences

• a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d.at n=37A047968
• Smallest number m such that m^2+1 is divisible by A002144(n)^2 (= squares of primes congruent to 1 mod 4).at n=28A059321
• Total sum of odd parts in all partitions of n.at n=24A066967
• If p and q are twin primes then pq + 1 is always divisible by 3, except for (p,q)=(3,5). Sequence gives values of (pq + 1)/3.at n=17A165280
• Number of n X 7 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=5A208636
• Number of 6 X n 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.at n=6A208641
• The greedy sequence of real numbers at least 1 that do not contain any 3-term geometric progressions with integer ratio.at n=25A235054
• Number of Dyck paths of semilength n having exactly 9 (possibly overlapping) occurrences of the consecutive steps UDUUUDDDUD (with U=(1,1), D=(1,-1)).at n=5A243879
• Number of partitions of n*(n-1)/2 into at most three parts.at n=33A274233
• Record values of A305566.at n=8A305657
• Number of solutions to k_1 + 2*k_2 + ... + n*k_n = 1, where k_i are from {-1,0,1}, i=1..n.at n=13A369628
• Consecutive states of the linear congruential pseudo-random number generator (1255*s + 6173) mod 29282 when started at s=1.at n=15A385339