The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265202 Total number of lambda-parking functions induced by all partitions of n into distinct parts. 4
 1, 1, 2, 6, 9, 15, 36, 53, 78, 119, 286, 401, 591, 829, 1232, 2910, 4084, 5789, 8070, 11281, 15823, 37747, 51622, 72919, 98986, 136600, 181648, 254638, 586891, 799841, 1110303, 1495279, 2018749, 2657612, 3552560, 4738775, 10857521, 14560375, 20061359, 26603227 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..400 R. Stanley, Parking Functions, 2011 EXAMPLE a(0) = 1: []. a(1) = 1: [1]. a(2) = 2: [1], [2]. a(3) = 6: [1], [2], [3], [1,1], [1,2], [2,1]. a(4) = 9: [1], [2], [3], [4], [1,1], [1,2], [1,3], [2,1], [3,1]. a(5) = 15: [1], [2], [3], [4], [5], [1,1], [1,2], [1,3], [1,4], [2,1], [2,2], [2,3], [3,1], [3,2], [4,1]. a(6) = 36: [1], [2], [3], [4], [5], [6], [1,1], [1,2], [1,3], [1,4], [1,5], [2,1], [2,2], [2,3], [2,4], [3,1], [3,2], [4,1], [4,2], [5,1], [1,1,1], [1,1,2], [1,1,3], [1,2,1], [1,2,2], [1,2,3], [1,3,1], [1,3,2], [2,1,1], [2,1,2], [2,1,3], [2,2,1], [2,3,1], [3,1,1], [3,1,2], [3,2,1]. MAPLE b:= proc(p, g, n, i, t) option remember; `if`(g=0, 0, p!/g!)+       `if`(n `if`(n=0, 1, b(0\$2, n, 1\$2)): seq(a(n), n=0..50); MATHEMATICA b[p_, g_, n_, i_, t_] := b[p, g, n, i, t] = If[g==0, 0, p!/g!] + If[n

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

Last modified July 7 12:47 EDT 2022. Contains 355148 sequences. (Running on oeis4.)