0,3

a(n) = A007088(A107909(A104161(n))) = A007088(A000975(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 28 2005

Fibonacci bit-representations of numbers for which there is only one possible representation and for which the maximal and minimal bit-representations (A104326 and A014417) are equal. The numbers represented are equal to the numbers in A000071 (subtract the first term of that sequence). For example, 10101 = 12 because 8+5+1. - Casey Mongoven (cm(AT)caseymongoven.com), Mar 19 2006

a(n) is sequence A000975(n) written in base 2. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 05 2009]

a(n) =floor[10^(n+1)/(10^2-1)] =a(n-2)+10^(n-1) =10a(n-1)-((-1)^n-1)/2

a(n+1)=sum{k=0..floor(n/2), 10^(n-2k) }; a(n+1)=sum{k=0..n, sum{j=0..k, (-1)^(j+k)10^j }}. - Paul Barry (pbarry(AT)wit.ie), Nov 12 2003

Partial sums of A015585. G.f.: 1/((1-x)(1+x)(1-10x)); a(n)=9a(n-1)+10a(n-2)+1; a(n)=10^(n+1)/99-(-1)^n/22-1/18; - Paul Barry (pbarry(AT)wit.ie), Nov 12 2003

Cf. A000975, A033113-A033119, A059848, A062864.

Sequence in context: A077712 A105032 A123522 this_sequence A096883 A033128 A094945

Adjacent sequences: A056827 A056828 A056829 this_sequence A056831 A056832 A056833

base,easy,nonn

Henry Bottomley (se16(AT)btinternet.com), Aug 30 2000

More terms from Casey Mongoven (cm(AT)caseymongoven.com), Mar 19 2006