45761
domain: N
Appears in sequences
- Expansion of (1+x)(1+x^2)/(1-x-x^3).at n=27A003410
- Strong pseudoprimes to base 8.at n=22A020234
- Expansion of (1 - x^2)/(1 - x - x^3).at n=31A058278
- Composite and every divisor (except 1) contains the digit 6.at n=11A062674
- a(n) = Sum_{k=0..n} C(n-k, floor(k/2)).at n=28A097333
- a(0) = 1, a(1) = 2, a(2) = 5; for n >= 3, a(n) = a(n-1) + 2*a(n-2) + a(n-3).at n=14A101399
- a(n) = a(n-3) + 2*a(n-6) + a(n-9).at n=42A109533
- Concatenating n with n+1 (in base 10) gives a number which is the product of 2 palindromes.at n=25A113942
- a(n) = (3 + 2*n + 6*n^2 + 4*n^3)/3.at n=32A166464
- a(n) = (16/3)*(n+1)*n*(n-1) + 8*n^2 + 1.at n=19A212668
- Positions of the positive integers in the ordering of rational numbers as generated by the rules: 1 is in S, and if nonzero x is in S, then x+1 and -1/x are in S. (See Comments.)at n=26A226136
- Positions of the integers in the ordering of rational numbers as generated by the rules: 1 is in S, and if nonzero x is in S, then x+1 and -1/x are in S. (See Comments.)at n=36A226137
- Number of new rationals produced at the n-th iteration by applying the map t -> {t+1, -1/t} to nonzero terms, starting with S[0] = {1}.at n=28A226275
- Number of (17,11)-reverse multiples with n digits.at n=64A226916
- Composite numbers n such that 2^lpf(n) == 2 (mod n), where lpf(n) = A020639(n).at n=36A276733
- Numbers k such that (29*10^k - 113)/3 is prime.at n=20A294637
- Number of multiset partitions of uniform integer partitions of n in which all parts have the same length.at n=49A320451
- a(n) = Sum_{k=0..n} (3*k+1) * binomial(5*n-2*k+1,n-k)/(5*n-2*k+1).at n=6A390712