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!)
A124048 a(n) = count of instances where the i-th permutation is divisible by i, treating the permutations of {0,1,...n-1} as integers base n in ascending order. 0

%I #5 May 05 2012 20:05:59

%S 1,2,1,7,4,11,8,26,23,30,14,28,45

%N a(n) = count of instances where the i-th permutation is divisible by i, treating the permutations of {0,1,...n-1} as integers base n in ascending order.

%e For n = 5, the first, 2nd, 7th and 18th permutations base 5 {01234, 01243, 02134, 03421} = decimal {194, 198, 294, 486} are divisible by 1,2,7 and 18 respectively. a(5) = 4.

%Y Cf. A124453.

%K nonn

%O 1,2

%A _David Scambler_, Nov 02 2006

%E a(13) from _Alois P. Heinz_, May 05 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 March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)