262148
domain: N
Appears in sequences
- Numbers that are the sum of 5 positive 9th powers.at n=21A003394
- Average theta series of odd unimodular lattices of dimension 10 (multiplied by 5).at n=8A029812
- Average theta series of odd unimodular lattices of dimension 18 (multiplied by 1385).at n=2A029819
- Sums of 2 distinct powers of 4.at n=37A038470
- Solutions to phi(gpf(x)) - gpf(phi(x)) = 65534 = c are special multiples of 65537, x=65537*k, where the largest prime factors of factor k were observed in {2, 3, 5, 17, 257}.at n=3A070816
- Unitary sigma-unitary phi super perfect numbers: USUP(USUP(n))= n/k for some integer k.at n=45A093863
- Bitwise XOR of adjacent terms of A101120; also the nonzero terms of A101122.at n=15A101121
- a(n) = A102371(n) + n. Or, 2*A103745.at n=18A105024
- a(1)=1. a(n) = the smallest integer > a(n-1) such that |d(a(n)) - d(a(n-1))| = n-1, where d(m) = the number of positive divisors of m.at n=13A139695
- a(n) = 2^n + 4.at n=18A140504
- a(0) = 4; for n >= 1, a(n) = 2^n + 4.at n=18A146528
- a(n) = smallest number that leads to a new cycle under the base-8 Kaprekar map of A165090.at n=11A165107
- a(n) = 4^n + 4.at n=9A178675
- a(n) = n^9 + n.at n=4A196290
- 1/4 the number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=34A209723
- Numbers of the form m = 2^i + 2^j, where i > j >= 0, such that m - 1 is prime.at n=45A239708
- Number of length n+2 0..3 arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=43A248428
- Primitive terms (not equal twice a smaller term) of A178751: moduli n such that x^y == -1 (mod n) only for x = -1 (mod n).at n=17A274003
- Lesser of amicable numbers pair m < n such that A307037(m) = n and A307037(n) = m.at n=8A307051
- a(n) is that generation of the rule-30 1D cellular automaton started from a single ON cell in which n successive OFF cells appears for the first time.at n=40A317530