22052

Appears in sequences

• A Fielder sequence.at n=14A001649
• a(0) = 1, a(n) = 18*n^2 + 2 for n>0.at n=35A010008
• Sorted Galois numbers.at n=39A028689
• Product of a prime and the previous number.at n=34A036689
• a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=38A047881
• Deficient oblong numbers.at n=25A077804
• a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.at n=34A087094
• a(n) = 4*a(n-1)-a(n-2)-3*a(n-3)+a(n-4), n>5.at n=8A107330
• Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 4.at n=40A128674
• a(n) is the smallest number, larger than the previous, such that the RMS (Root Mean Square) of a(0) through a(n) is an integer.at n=14A141393
• Total number of Fibonacci parts in all partitions of n.at n=26A144115
• a(n) = (9*n+4)*(9*n+5).at n=16A177073
• Number of isomorphism classes of simply embedded (i.e., loop-free and without parallel edges bounding a disk) bipartite quadrangulations of RP^2 of minimum degree 3 with n nodes and n-1 faces.at n=12A187014
• Numbers n such that there is no square n-gonal number greater than 1.at n=26A188896
• Permanent of the n-th principal submatrix of A204260.at n=5A204261
• Multiplicative order of 2 modulo prime(n)^2 for n >= 2.at n=33A243905
• Numbers m such that gcd(A001008(m), m) > 1, in increasing order.at n=35A256102
• Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n.at n=16A280187
• a(n) is the least exponent k such that 3^k-1 is divisible by prime(n)^2, or -1 if no such k exists.at n=34A283620
• a(n) is the Pisano period of prime(n)^2.at n=34A343116