Search: id:A046698
Results 1-1 of 1 results found.

%I A046698
%S A046698 0,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%T A046698 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U A046698 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2
%N A046698 a(0) = 0, a(1) = 1, a(n) = a(a(n-1)) + a(a(n-2)) if n > 1.
%C A046698 Partial sums are A004275. Binomial transform is A048492, starting with 
               0. - Paul Barry (pbarry(AT)wit.ie), Feb 28 2003
%D A046698 Sequence proposed by Reg Allenby.
%H A046698 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Fibonaccin-StepNumber.html">Fibonacci n-Step Number</a>
%F A046698 G.f.: x(1+x^2)/(1-x) - Paul Barry (pbarry(AT)wit.ie), Feb 28 2003
%F A046698 a(n)=2*[(n+2) mod (n+1)]-[C(n^2,n+2) mod 2]-[C((n+1)^2,n+3) mod 2] - 
               Paolo P. Lava (ppl(AT)spl.at), Sep 03 2007
%p A046698 P:=proc(n) local a,i; for i from 0 by 1 to n do a:=2*((i+2) mod (i+1))-(binomial((i)^2,
               i+2) mod 2)-(binomial((i+1)^2,i+3) mod 2); print(a); od; end: P(100); 
               - Paolo P. Lava (ppl(AT)spl.at), Sep 03 2007
%o A046698 (PARI) a(n)=(n>0)+(n>2)
%Y A046698 Sequence in context: A065685 A084100 A130130 this_sequence A036453 A040000 
               A007395
%Y A046698 Adjacent sequences: A046695 A046696 A046697 this_sequence A046699 A046700 
               A046701
%K A046698 nonn,easy
%O A046698 0,4
%A A046698 N. J. A. Sloane (njas(AT)research.att.com), R. K. Guy

Search completed in 0.001 seconds