17963
domain: N
Appears in sequences
- 12-gonal (or dodecagonal) pyramidal numbers: a(n) = n*(n+1)*(10*n-7)/6.at n=22A007587
- Number of segments (and sides) created by diagonals of an n-gon in general position.at n=20A014628
- a(1) = 7; a(n+1) = a(n)-th composite.at n=36A025011
- Quasi-Carmichael numbers to base 8: squarefree composites n such that (n,2*3*5*7) = 1 and prime p|n ==> p-8|n-8.at n=1A029555
- Multiplicity of highest weight (or singular) vectors associated with character chi_178 of Monster module.at n=39A034566
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=25A070193
- Row sums of triangle A134392.at n=21A134393
- Number of line segments in regular n-gon with all diagonals drawn.at n=22A135565
- Numbers n such that sigma(lambda(n)) = lambda(sigma(n)).at n=36A173942
- Composite squarefree numbers n such that p-d(n) divides n-d(n), where p are the prime factors of n and d(n) the number of divisors of n.at n=17A228300
- Quasi-Carmichael numbers to exactly two bases.at n=33A257752
- Quasi-Carmichael numbers to at least one negative base and at least one positive base.at n=7A257759
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 329", based on the 5-celled von Neumann neighborhood.at n=29A271275
- G.f.: Sum_{n>=0} (n+1)*(n+2)/2 * x^n * (1 + x^n)^n.at n=42A326003
- Odd composite integers m such that A004254(m-J(m,21)) == 0 (mod m) and gcd(m,21)=1, where J(m,21) is the Jacobi symbol.at n=35A340098
- Numbers k such that A361338(k) = 9.at n=39A361348