19950

Appears in sequences

• Second-order Eulerian numbers <<n,2>>.at n=6A004301
• Second-order Eulerian triangle T(n,k), 1 <= k <= n.at n=30A008517
• a(n) is least k such that k and 7k are anagrams in base n (written in base 10).at n=12A023099
• Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=29A034587
• Numbers k such that k^6 + 1091 is prime.at n=12A066386
• Numbers n with property that n sets a new record for number of ways to write n as the sum of a brilliant number and a prime.at n=45A084418
• Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.at n=34A091235
• a(n) = binomial(n+2,2) * binomial(n+7,2).at n=13A104676
• Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.at n=33A112007
• Natural numbers that can be factored into the product of three positive integers whose minimal sum is achieved in more than one way.at n=20A112536
• The z^2 coefficients of the polynomials in the GF1 denominators of A156921.at n=6A157706
• Triangle related to the o.g.f.s. of the right-hand columns of A130534 (E(x,m=1,n)).at n=41A163936
• 7 times hexagonal numbers: a(n) = 7*n*(2*n-1).at n=38A195320
• Smallest number k such that k^n is the sum of numbers in a twin prime pair.at n=44A195336
• Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.at n=38A201637
• Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array.at n=24A219774
• Number of ways of writing n as the sum of 7 triangular numbers.at n=45A226252
• Numbers k such that 1/phi(x) + 1/phi(y) = 1/phi(k), for some x + y = k and phi(k) is the Euler totient function of k.at n=19A279621
• Unitary practical numbers that are nonsquarefree.at n=14A287173
• Number of tilings of a stackable 8 sphinx tile shape.at n=4A287999