login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100843 F(P(n)) where P(n) is the unrestricted partition number of n and F(n) is the Fibonacci number. 1
1, 1, 2, 5, 13, 89, 610, 17711, 832040, 267914296, 225851433717, 5527939700884757, 573147844013817084101, 7308805952221443105020355490, 2706074082469569338358691163510069157, 844617150046923109759866426342507997914076076194 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Seiichi Manyama, Table of n, a(n) for n = 1..29

FORMULA

a(n) =  A000045(A000041(n)). - Michel Marcus, Aug 27 2015

EXAMPLE

a(4) = F(P(4)) = F(5) = 5.

a(8) = F(P(8)) = F(22) = 17711.

MATHEMATICA

Table[Fibonacci[PartitionsP[n]], {n, 1, 20}] (* Stefan Steinerberger, Feb 28 2006 *)

PROG

(MAGMA) [Fibonacci(NumberOfPartitions(n)): n in [1..20]]; // Vincenzo Librandi, Aug 27 2015

CROSSREFS

Sequence in context: A030426 A075742 A075737 * A082101 A158712 A090472

Adjacent sequences:  A100840 A100841 A100842 * A100844 A100845 A100846

KEYWORD

nonn

AUTHOR

Parthasarathy Nambi, Jan 07 2005

EXTENSIONS

More terms from Stefan Steinerberger, Feb 28 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 27 16:49 EDT 2017. Contains 287207 sequences.