22011

Appears in sequences

• a(n) = floor(n*(n+2)*(2*n-1)/8).at n=43A007518
• dot_product(n,n-1,...2,1)*(6,7,...,n,1,2,3,4,5).at n=40A026063
• Denominators of continued fraction convergents to sqrt(685).at n=9A042317
• Triangle of rooted planar maps up to orientation-preserving isomorphisms.at n=53A046653
• Numbers n such that 91*2^n-1 is prime.at n=30A050571
• A064637 converted to factorial base.at n=19A064477
• Starting positions of strings of three 5's in the decimal expansion of Pi.at n=20A083620
• Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n.at n=40A111036
• Take the base-3 representation of n, render that in decimal notation and take the base-3 representation of n again.at n=24A126135
• A Fibonacci-based recurrence.at n=23A139759
• a(n) = prime(2*n^2) - 2*n^2.at n=36A141086
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (-1, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=8A149646
• Starting from a(1)=2, a(n) = A028260(1+a(n-1)) if n is even, a(n) = A026424(a(n-1)) if n is odd.at n=13A160966
• "Early bird" squares: write the square numbers in a string 149162536496481100... . Sequence gives numbers k such that k^2 occurs in the string ahead of its natural place.at n=39A181585
• Numbers k such that sopfr(k + bigomega(k)) = sopfr(k).at n=28A187877
• Numbers k such that sopfr(k + omega(k)) = sopfr(k), where sopfr(i) = A001414(i) and omega(i) = A001221(i).at n=23A187878
• Numbers n such that sum of 5th power of digits of n equals the sum of prime divisors of n.at n=0A217533
• Least k such that sum of n-th power of digits of k equals sum of prime divisors of k.at n=4A240387
• Number of (3+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=14A250758
• Partial sums of A255744.at n=25A255765