Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006490 a(1) = 1, a(2) = 0; for n >2, a(n)=n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).
(Formerly M2362)
+0
4
1, 0, 3, 4, 10, 18, 35, 64, 117, 210, 374, 660, 1157, 2016, 3495, 6032, 10370, 17766, 30343, 51680, 87801, 148830, 251758, 425064, 716425, 1205568, 2025675, 3399004, 5696122, 9534330, 15941099, 26625280, 44426877, 74062506, 123360230 (list; graph; listen)
page 1

Search completed in 0.002 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research