19632

Appears in sequences

• a(n) is least k such that k and 8k are anagrams in base n (written in base 10).at n=16A023100
• Smallest number at distance n from nearest prime.at n=23A051652
• Smallest number at distance 2n+1 from nearest prime.at n=11A051729
• a(n) is the smallest number for which the prime distance A051699 is equal to n.at n=23A077019
• Least positive k such that the distance from k to closest prime = n.at n=23A079582
• Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square in the center.at n=23A089474
• Cascadence of (1+2x)^2; a triangle, read by rows of 2n+1 terms, that retains its original form upon convolving each row with [1,4,4] and then letting excess terms spill over from each row into the initial positions of the next row such that only 2n+1 terms remain in row n for n>=0.at n=28A120914
• Smaller side not divisible by 37 of right triangles with integer sides and integer side inscribed squares with two vertices on the hypotenuse.at n=24A123697
• Numerator of Euler(n, 3/19).at n=4A156694
• Number of (n+1)X(1+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=7A232849
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=28A232852
• a(n) = A273059(4n+3).at n=24A275919
• Number of n X n Fishburn matrices with entries in the set {0,1,2}.at n=4A289314
• Number of normal generalized Young tableaux of size n with all rows and columns weakly increasing and all regions non-singleton skew-partitions.at n=10A299967
• Number A(n,k) of n X n Fishburn matrices with entries in the set {0,1,...,k}; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=25A369415