25593
domain: N
Appears in sequences
- Numbers k such that 141*2^k+1 is prime.at n=42A032420
- Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/2.at n=12A084814
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=30A157116
- Number of unlabeled rooted semi-identity trees with n nodes.at n=14A306200
- Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 6 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=6 and b=-1, respectively.at n=24A337629
- Odd composite integers m such that A085447(m) == 6 (mod m).at n=32A338078
- Number of partitions of n in which exactly one odd part is repeated and even parts are unrestricted.at n=41A353903
- a(n) = Sum_{k=0..n-2} A205497(n, k) * (1 - k mod 2) if n >= 2, a(0) = a(1) = 1.at n=10A373752
- a(n) = Sum_{k=0..floor(n/2)} binomial(n-2*k,floor(k/3)).at n=45A376695