Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100843
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100843 F(P(n)) where P(n) is the unrestricted partition number of n and F(n) is the Fibonacci number. +0
1
1, 1, 2, 5, 13, 89, 610, 17711, 832040, 267914296, 225851433717, 5527939700884757, 573147844013817084101, 7308805952221443105020355490, 2706074082469569338358691163510069157, 844617150046923109759866426342507997914076076194 (list; graph; listen)
OFFSET

1,3

EXAMPLE

If n=4, F(P(4)) = 5

If n=8, F(P(8)) = 17711

MATHEMATICA

Table[Fibonacci[PartitionsP[n]], {n, 1, 20}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 28 2006

CROSSREFS

Adjacent sequences: A100840 A100841 A100842 this_sequence A100844 A100845 A100846

Sequence in context: A030426 A075742 A075737 this_sequence A082101 A090472 A120266

KEYWORD

nonn

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Jan 07 2005

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 28 2006

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 October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research