60688

Appears in sequences

• a(n) = 2*a(n-1) + 10*a(n-2), with a(0) = 1, a(1) = 12.at n=7A083101
• a(n) = 2*a(n-1) + 10*a(n-2), a(0)=1, a(1)=1.at n=8A133294
• Numbers k such that k and k^2 use only the digits 0, 3, 4, 6 and 8.at n=14A136931
• An even-powered type Binet p-adic triangular sequence: t(n,m)=((( 1 + sqrt(prime(n))))^(2*m) + (( 1 - sqrt(prime(n))))^(2*m))/2.at n=13A140896
• Number of binary strings of length n with no substrings equal to 0001 or 0111.at n=21A164397
• Partial sums of floor(Fibonacci(n)/2).at n=24A178982
• Number of nondecreasing arrangements of 6 numbers x(i) in -(n+4)..(n+4) with the sum of sign(x(i))*x(i)^2 zero.at n=28A188006
• Number of partitions of n that sorted in increasing order contain a part k in position k for some k.at n=43A238395
• a(0) = 0, and for n > 0, (a(n)) gives the indices n for which d(n) > d(k) for k < n, where d is the difference sequence of (cos k + sin k).at n=15A299639