22348
domain: N
Appears in sequences
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=34A037167
- a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482).at n=29A074484
- Number of n-digit squares with no zero digits, having roots containing at least one zero.at n=10A104317
- Numbers which converge to 2592 under repeated application of the powertrain map of A133500.at n=20A135384
- Triangle read by rows, characteristic polynomials of matrices; (n X n bisymmetric matrices in which both diagonals equal the (n-1)-th row of Pascal's triangle with the rest zeros). (n>=0, 0<=k<=ceiling(n/2)).at n=31A140693
- Fibonacci-like sequence of numbers with nondecreasing positive digits. Let a^+ denote the number that is obtained from a if its positive digits are written in nondecreasing order, while zeros remain in their places. Let a<+>b = (a + b)^+. a(0)=0, a(1)=1, for n>=2, a(n) = a(n-1) <+> a(n-2).at n=73A237568
- Integers k that have the property that there exists an integer x with n+1 digits, such that 1 <= k/x < 2 and k/x = 1 + (x-10^n)/(10^n-1), i.e., the same digits appear in the denominator and in the recurring decimal.at n=13A288782
- Number of parts in all partitions of n in which no part occurs more than five times.at n=28A320608
- Triangle read by rows: T(n,k) = number of j-covers of [n] with j<=k, k=1..2^n-1.at n=18A369950
- Expansion of g^2/(1 - x^3*g^4), where g = 1+x*g^3 is the g.f. of A001764.at n=7A391130