26180
domain: N
Appears in sequences
- Composite a(n) divided by the palindromic sum of its prime factors is a palindrome (counted with multiplicity).at n=5A046361
- a(n) in base 13 is a repdigit.at n=47A048337
- Numbers n such that x^n + x^11 + 1 is irreducible over GF(2).at n=35A057481
- Number of subgroups of the group GL(2,Z_n) of invertible 2 X 2 matrices mod n (sequence A000252).at n=13A066514
- Triangle of 3-Narayana numbers, N(n,k), for n >= 1, 0 <= k <= 2n-2.at n=39A087647
- Triangle of 3-Narayana numbers, N(n,k), for n >= 1, 0 <= k <= 2n-2.at n=45A087647
- Number of -n..n arrays of 4 elements with zero sum and no two neighbors summing to zero.at n=16A199833
- Number of -n..n arrays x(0..3) of 4 elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing.at n=22A200193
- a(n) = 2*n*(n+1)*(n+2)/3.at n=33A210440
- Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y<=3z.at n=14A212513
- Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y>3z.at n=22A212514
- Degrees of irreducible representations of orthogonal group O10-(2).at n=24A214475
- Degrees of irreducible representations of orthogonal group O10-(2).at n=25A214475
- Primitive integer length of the side of an origin-centered square that contains inside its boundary a point with integer coordinates that is an integer distance from three of the four corners.at n=18A215365
- Triangular array read by rows, T(n,k) = number of partial functions on {1,2,...,n} with exactly k cycles.at n=32A216520
- Numbers k such that 3^k - 8 is prime.at n=20A217135
- Primitive values n such that the square with opposite corners (0,0) and (n,n) contains a point (x,y) with integer coordinates, with 0 < x,y < n, at an integer distance from three of the four corners.at n=35A260549
- GCD of A002443(n) and A002444(n), numerator and denominator in Feinler's formula for the Bernoulli number B_{2n}.at n=40A266911
- Partial sums of the odd triangular numbers (A014493).at n=33A352116
- Numbers k which have a factorization k = f1*f2*...*fr where the digits of {k, f1, f2, ..., fr} together give 0,1,...,9 exactly once.at n=26A370970