33515

Appears in sequences

• A generalized difference set on the set of all integers (lambda = 1).at n=25A024431
• In base 3: smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=25A077403
• Numbers k such that k and k^2 use only the digits 1, 2, 3, 4 and 5.at n=30A136968
• Numbers k such that k and k^2 use only the digits 1, 2, 3 and 5.at n=14A136973
• Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 6.at n=52A136974
• Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 7.at n=19A136975
• Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 8.at n=29A136976
• Numbers k such that k and k^2 use only the digits 1, 2, 3, 5 and 9.at n=31A136977
• a(n) = 76*n^2 - 1.at n=20A158765
• Numbers k such that the decimal expansions of both k and k^2 have 1 as smallest digit and 5 as largest digit.at n=7A256889
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.at n=29A273640
• Expansion of Product_{k>=1} 1/(1 - x^k)^(k*(k+1)*(2*k+1)/6).at n=10A279215
• Numbers k such that the coefficient of x^k in the expansion of Product_{m >= 1} (1-x^m)^15 is zero.at n=12A322043
• a(n) = Sum_{k<n} ((2^n-1) mod (2^k-1)).at n=28A329162
• Number of unlabeled simple graphs with n vertices and n edges such that it is not possible to choose a different vertex from each edge (non-choosable).at n=12A369201
• a(n) = 25*n^2/2 - 11*n/2 + 1.at n=52A383465