22365

Appears in sequences

• a(n) is the number of conjugacy classes in the alternating group A_n.at n=40A000702
• Odd primitive abundant numbers.at n=30A006038
• Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.at n=28A075460
• Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded.at n=23A085844
• Number of singular n X n rational {0,1}-matrices with no zero rows or columns and with all rows distinct and all columns distinct, up to permutation of rows.at n=4A116527
• One-fourth of partial sums of A153976.at n=19A153977
• Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors.at n=31A188439
• Number of essentially different ways of arranging numbers 1 through 2n around a circle so that the sum and absolute difference of each pair of adjacent numbers are prime.at n=12A227050
• Odd numbers in A192274.at n=37A243104
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 131", based on the 5-celled von Neumann neighborhood.at n=32A270223
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 805", based on the 5-celled von Neumann neighborhood.at n=14A284140
• Irregular triangle read by rows where row n lists all odd primitive abundant numbers with n prime factors, counted with multiplicity.at n=29A287646
• Column 3 of A060244.at n=29A291553
• Number of n X 3 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 neighboring 1s.at n=11A297426
• Odd recursive abundant numbers: odd numbers k such that A333926(k) > 2*k.at n=31A333950
• Number of transitive relations on an n-set with exactly two ordered pairs.at n=15A349919
• a(n) = Sum_{k=0..floor(n/5)} (n-4*k)!/(n-5*k)!.at n=28A357570
• Odd cubefree abundant numbers.at n=31A357697
• Square array read by antidiagonals upwards: T(i,j) is the smallest number m such that the symmetric representation of sigma, SRS(m), has maximum width 3, consists of i parts and has 2*j occurrences of maximum width 3 in its width pattern (row m of A341969).at n=24A377667
• Primitive terms of A388034.at n=43A388035