23781

Appears in sequences

• Partitions into non-integral powers (see Comments for precise definition).at n=16A000234
• Sum of 11 positive 9th powers.at n=20A004800
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 90 ones.at n=21A031858
• First differences are A005563.at n=40A047732
• Numbers n such that prime[(n + 1)^2] - prime[n^2] is a perfect square.at n=27A145290
• Number of Dyck paths of semilength n having exactly 1 occurrence of the consecutive steps UDUUUDDDUD (with U=(1,1), D=(1,-1)).at n=8A243871
• Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive steps UDUUUDDDUD (with U=(1,1), D=(1,-1)); triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/4)), read by rows.at n=26A243881
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 670", based on the 5-celled von Neumann neighborhood.at n=36A273394
• Numbers k such that (13*10^k + 161)/3 is prime.at n=21A284779
• Number of n X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1's.at n=4A297796
• Number of n X 5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1's.at n=4A297799
• T(n,k) = Number of n X k 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1's.at n=40A297802
• Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1s.at n=4A297805
• Square array A(n, k) = A388283(A246278(n, k)), read by falling antidiagonals. Numerator of (3*n-sigma(n))/n, as applied to the prime shift array.at n=74A388284
• Centered 29-gonal numbers.at n=40A389798
• Truncated centered square numbers: a(n) = 14*n^2 - 22*n + 9.at n=41A389928