30229

Appears in sequences

• Numerators of continued fraction convergents to sqrt(263).at n=10A041492
• Numbers k such that sigma(k+1) = 2*phi(k).at n=16A067260
• Number of binary necklaces of length n with no subsequence 000.at n=21A093305
• a(n) = A168174(n)-10^12.at n=34A168248
• Number of distinct integers that can be generated by an expression containing n binary operators (any of add, subtract, multiply and divide) whose operands are any integer between 1 and 9; parenthesis allowed.at n=5A181959
• Composite numbers whose sum of aliquot parts divides the sum of the aliquot parts of the numbers less than or equal to n and not relatively prime to n.at n=25A249109
• Number of length n+1 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=16A255108
• Number of (n+1) X (n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=4A262465
• Number of (n+1)X(5+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=4A262469
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=40A262472
• Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.at n=4A262475
• Expansion of Sum_{k>=0} binomial(k,floor(k/2))*x^k/Product_{j=1..k} (1 - j*x).at n=8A305560
• Squarefree terms of A129802 whose prime factors are neither elite (A102742) nor anti-elite (A128852), where A129802 is the possible bases for Pepin's primality test for Fermat numbers.at n=10A372895