160801

Appears in sequences

• a(n) = (11*n + 5)^2.at n=36A017450
• a(n) = (12*n + 5)^2.at n=33A017582
• Discriminants of totally real quintic fields.at n=23A023683
• Smallest composite k such that phi(k) > k*(1-1/n^2).at n=19A069639
• Main diagonal of A082043: a(n) = n^4 + 2*n^2 + 1.at n=20A082044
• Squares of A006450: a(n) = prime(prime(n))^2.at n=21A092769
• Squares in A076361.at n=36A115557
• Numbers k such that sigma(k) - phi(k) is a brilliant number (A078972).at n=28A115917
• 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, 0, 0), (-1, 0, 1), (0, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=9A149787
• Squares in A111153.at n=20A175255
• Kashaev's invariant for the (9,2)-torus knot.at n=2A208681
• Prime powers (A025475) representable as (p+q)/2, where p and q are distinct prime powers.at n=28A225388
• Numbers n such that the number of digits d in n is not prime and for each factor f of d the sum of the d/f digit groupings of size f is a square.at n=9A258660
• Squares of primes congruent to 1 (mod 30).at n=34A330670
• The position of the first n in A339895.at n=46A339897
• Rotationally ambigrammatic square numbers with no trailing zeros.at n=23A340164
• Perfect powers such that the two immediately adjacent perfect powers both have an exponent greater than 2.at n=12A340642
• Numbers k for which phi(k)+1 is a multiple of d(k), where phi is Euler totient function (A000010) and d(n) gives the number of divisors of n (A000005).at n=47A342665
• Numbers of the form prime(p)^q where p and q are primes. Prime powers whose prime index and exponent are both prime.at n=31A352519
• Numbers that decrease two times in succession when they are iteratively replaced by the "Look and Say" description (cf. A045918) of their prime factors, counted with multiplicity.at n=5A379455