login
This site is supported by donations 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
1, 2, 1, 7, 4, 11, 8, 26, 23, 30, 14, 28 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

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

CROSSREFS

Cf. A124453.

Sequence in context: A089225 A185110 A075085 * A087059 A120872 A141512

Adjacent sequences:  A124045 A124046 A124047 * A124049 A124050 A124051

KEYWORD

nonn

AUTHOR

David J. Scambler (dscambler(AT)bmm.com), Nov 02 2006

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.