29756
domain: N
Appears in sequences
- Product of a prime and the previous number.at n=39A036689
- Deficient oblong numbers.at n=30A077804
- Binomial transform of [1, 5, 15, 35, 70, 0, 0, 0, ...].at n=11A143132
- a(n) = 25*n^2 + 25*n + 6.at n=34A177059
- Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding four.at n=33A189325
- G.f. satisfies A(x) = (1 + 2*x*A(x)) * (1 + x*A(x)^2).at n=6A215661
- Oblong numbers (A002378) whose sum of divisors is also an oblong number.at n=9A226363
- Number of self-inverse permutations p on [n] with displacement of elements restricted by 4: |p(i)-i| <= 4.at n=13A239076
- Multiplicative order of 2 modulo prime(n)^2 for n >= 2.at n=38A243905
- Numbers m such that gcd(A001008(m), m) > 1, in increasing order.at n=40A256102
- Numbers that are both interprime and oblong.at n=42A263676
- Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n.at n=18A280187
- a(n) is the least exponent k such that 3^k-1 is divisible by prime(n)^2, or -1 if no such k exists.at n=39A283620
- Multiplicative order of 5 (mod p^2), where p = prime(n), or 0 if 5 and p are not coprime.at n=39A305331
- a(n) = sum of the first n primes whose distance to next prime is 4.at n=49A360226
- Record values in A377059.at n=46A378029