35425

Appears in sequences

• 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.at n=25A006007
• Strong pseudoprimes to base 18.at n=20A020244
• Strong pseudoprimes to base 32.at n=37A020258
• Strong pseudoprimes to base 57.at n=23A020283
• Numbers that are the sum of 2 nonzero squares in exactly 6 ways.at n=34A025289
• Numbers that are the sum of 2 distinct nonzero squares in exactly 6 ways.at n=34A025307
• Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 41.at n=2A031629
• Number of partitions satisfying (cn(1,5) <= cn(2,5) and cn(1,5) <= cn(3,5) and cn(4,5) <= cn(2,5) and cn(4,5) <= cn(3,5)).at n=51A036803
• a(n) = gcd(binomial(2n,n), 2^n + 1).at n=89A066975
• a(n) = n*(n^2 + 1) if n is even, otherwise (n - 1/2)*(n^2 + 1).at n=33A071289
• Perimeter of integer triangle (A001611(n), A001611(n+1), A001611(n+2)).at n=20A097280
• Structured small rhombicosidodecahedral numbers.at n=12A100148
• Number of positive integers <= 10^n that are divisible by no prime exceeding 5.at n=27A106598
• Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^3 equal to 49*n^3.at n=38A184322
• Numbers such that the sequence of all possible sums of divisors of n is increasing but not strictly so, the sums being ordered by their characteristic functions, seen as binary numbers (see example).at n=15A230492
• Pseudoprimes to base 7 that are not squarefree.at n=10A243089
• a(n) = n*(n+1)*(13*n+2)/6.at n=25A257093
• Euler pseudoprimes to base 7: composite integers such that abs(7^((n - 1)/2)) == 1 mod n.at n=25A262054
• Octagonal numbers with prime indices.at n=28A267144
• Nonsquarefree numbers n = p_1^s_1...p_m^s_m (m > 1) such that (p_i^s_i - 1) | n-1 for all 0 < i <= m.at n=2A292815