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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005127 Number of k for which n does not divide Stirling cycle numbers [ {n \atop k} ]. 2

%I #17 Oct 28 2012 05:24:08

%S 1,0,2,2,4,2,5,2,6,4,5,2,9,2,9,7,8,2,9,2,12,7,9,2,13,6,9,10,18,2,19,2,

%T 12,8,5,10,16,2,9,10,18,2,20,2,22,17,17,2,19,8,15,19,23,2,27,9,25,7,

%U 17,2,37,2,33,16,20,14,20,2,12,19,26,2,28,2,9,25,22,16,37,2,26,28,9,2

%N Number of k for which n does not divide Stirling cycle numbers [ {n \atop k} ].

%C a(n) = sum(A057427(A145201(k)), 1<=k<=n) for n>0. [_Reinhard Zumkeller_, Jul 04 2009]

%H Vincenzo Librandi, <a href="/A005127/b005127.txt">Table of n, a(n) for n = 0..10000</a>

%t Prepend[Array[Length[Select[Table[StirlingS1[#, k]/#, {k, 0, #}], ! IntegerQ[#] &]] &, 100], 1]

%K nonn

%O 0,3

%A _Olivier GĂ©rard_

%E Mathematica code fixed by _Vincenzo Librandi_, Oct 27 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)