30535

Appears in sequences

• Strong pseudoprimes to base 36.at n=24A020262
• Denominators of continued fraction convergents to sqrt(273).at n=9A041513
• Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).at n=43A082538
• 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, 0), (-1, 1, 0), (1, 0, 0), (1, 1, 0), (1, 1, 1)}.at n=7A151236
• Positive numbers y such that y^2 is of the form x^2 + (x+31)^2 with integer x.at n=13A157646
• G.f.: A(x) = Sum_{n>=0} x^n * Product_{d|n} (1 + x^d)^(n/d).at n=19A193200
• Number of n X n binary matrices with zero diagonal and no 2-loops or directed 3-loops (3-loop: x(i,j)*x(j,k)*x(k,i)=1, and i,j,k all different).at n=4A213599
• Numbers n such that n!!-8 is prime.at n=26A259359
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 910", based on the 5-celled von Neumann neighborhood.at n=14A284402
• Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=5A299076
• Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=2A299079
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=30A299081
• T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=33A299081
• Number of n X 6 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=2A299842
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=30A299844
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero.at n=33A299844
• Number of subsets of {1..n} whose greatest element can be written as a (strictly) positive linear combination of the others.at n=37A365043
• a(n) = Sum_{j=1..n} Sum_{k=1..n} phi(j*k) / phi(k).at n=42A372636