139810
domain: N
Appears in sequences
- Numbers whose set of base-16 digits is {2,3}.at n=30A032816
- Numbers in which all pairs of consecutive base-4 digits differ by 2.at n=25A033082
- Expansion of (1-x)/(1-x-x^2-x^3+x^4).at n=24A052527
- a(n) = n*(n+1)*(n^2 + 2)/6.at n=30A071239
- Expansion of 1/((1-x)*(1+2*x+x^2+2*x^3)).at n=18A077931
- Expansion of 1/((1-2*x)*(1-x^4)).at n=17A083593
- Decimal form of the binary numbers 10, 100010, 1000100010, 10001000100010, 100010001000100010,...at n=4A098704
- Expansion of 1/((1+x)*(1-2*x)*(1+x^2)).at n=18A115451
- G.f. x^2*(-1+x+x^2)/((1-x)*(2*x-1)*(x+1)*(x^2+1)).at n=21A115851
- a(0)=0, a(n)=4a(n-1)+2 for n odd, a(n)=4a(n-1) for n even.at n=9A117616
- a(n)=a(n-1)+a(n-2)+a(n-3)+2a(n-4).at n=21A139800
- a(0)=0; a(n+1) = 2*a(n) + period 4:repeat 0,1,-2,1.at n=21A181586
- a(n) is the least positive number which yields a multiple of n when its binary digit string, S(n), is read in any numeric base; a(n) is displayed in base 10.at n=4A329000
- a(n) = 2^A051903(n)*Sum_{k=0..n-1} 2^(A268336(n)*k): upper bound for A329000(n).at n=4A329339