|
Search: id:A140892
|
|
|
| A140892 |
|
(n-1)^F(n) - F(n)^(n-1), where F(n) = n-th Fibonacci number. |
|
+0
1
|
|
| 0, 0, 0, 0, 399, 357857, 1286604292, 558545862282195466, 5070602400912917604201018916608, 30432527221704537086371993251530170527181380482652674, 99999999999999999999999999999999999999999999999999999999999999999999968818280070\ 033816399
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
FORMULA
|
a(n) = (n-1)^A000045(n) - A000045(n)^(n-1). - Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 12 2008
|
|
EXAMPLE
|
If n=1 then a(1)=(1-1)^F(1)-F(1)^(1-1)=0^1-1^0=0-0=0
If n=2 then a(2)=(2-1)^F(2)-F(2)^(2-1)=1^1-1^1=1-1=0
If n=3 then a(3)=(3-1)^F(3)-F(3)^(3-1)=2^2-2^2=4-4=0
If n=4 then a(4)=(4-1)^F(4)-F(4)^(4-1)=3^3-3^3=27-27=0
If n=5 then a(5)=(5-1)^F(5)-F(5)^(5-1)=4^5-5^4=1024-625=399
|
|
CROSSREFS
|
Cf. A000045, A000071, A007965.
Cf. A000045, A000071, A007965.
Sequence in context: A065767 A166915 A110885 this_sequence A115470 A061042 A037991
Adjacent sequences: A140889 A140890 A140891 this_sequence A140893 A140894 A140895
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 07 2008
|
|
EXTENSIONS
|
More terms from Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 12 2008
|
|
|
Search completed in 0.002 seconds
|
