Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140892
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A140892
%S A140892 0,0,0,0,399,357857,1286604292,558545862282195466,
%T A140892 5070602400912917604201018916608,
%U A140892 30432527221704537086371993251530170527181380482652674,9999999999999999999999999999999999999999999999999999999\
               9999999999999968818280070033816399
%N A140892 (n-1)^F(n) - F(n)^(n-1), where F(n) = n-th Fibonacci number.
%F A140892 a(n) = (n-1)^A000045(n) - A000045(n)^(n-1). - Jonathan Vos Post (jvospost3(AT)gmail.com), 
               Jul 12 2008
%e A140892 If n=1 then a(1)=(1-1)^F(1)-F(1)^(1-1)=0^1-1^0=0-0=0
%e A140892 If n=2 then a(2)=(2-1)^F(2)-F(2)^(2-1)=1^1-1^1=1-1=0
%e A140892 If n=3 then a(3)=(3-1)^F(3)-F(3)^(3-1)=2^2-2^2=4-4=0
%e A140892 If n=4 then a(4)=(4-1)^F(4)-F(4)^(4-1)=3^3-3^3=27-27=0
%e A140892 If n=5 then a(5)=(5-1)^F(5)-F(5)^(5-1)=4^5-5^4=1024-625=399
%Y A140892 Cf. A000045, A000071, A007965.
%Y A140892 Cf. A000045, A000071, A007965.
%Y A140892 Sequence in context: A065767 A166915 A110885 this_sequence A115470 A061042 
               A037991
%Y A140892 Adjacent sequences: A140889 A140890 A140891 this_sequence A140893 A140894 
               A140895
%K A140892 nonn
%O A140892 1,5
%A A140892 Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 07 2008
%E A140892 More terms from Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 12 2008

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research