Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 2, 1, 7, 4, 11, 8, 26, 23, 30, 14, 28 (list; graph; listen)
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.

Adjacent sequences: A124045 A124046 A124047 this_sequence A124049 A124050 A124051

Sequence in context: A107865 A089225 A075085 this_sequence A087059 A120872 A141512

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research