a(n) is the number of permutations of the divisors of n of the form d_1=n, d_2, d_3,...,d_tau(n) such that d_(i+1)/d_i is a prime or 1/prime for all i.
1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 1, 3, 1, 3, 2, 2, 1, 4, 1, 2, 1, 3, 1, 18, 1, 1, 2, 2
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
15 seqfan posts
Tue Aug 24 15:28:19 CEST 2010 [seqfan] A combinatorial problem: non-sorting algorithms for A179926 and A180026
Sat Aug 7 19:21:18 CEST 2010 [seqfan] A combinatorial problem: generalization
Wed Aug 4 23:09:36 CEST 2010 [seqfan] Re: A combinatorial problem
Wed Aug 4 20:27:16 CEST 2010 [seqfan] Re: A combinatorial problem
Wed Aug 4 15:24:12 CEST 2010 [seqfan] Re: A combinatorial problem
Wed Aug 4 13:52:34 CEST 2010 [seqfan] Re: A combinatorial problem
Wed Aug 4 08:36:44 CEST 2010 [seqfan] Re: A combinatorial problem
Tue Aug 3 11:00:45 CEST 2010 [seqfan] Re: A combinatorial problem
Tue Aug 3 10:18:04 CEST 2010 [seqfan] Re: A combinatorial problem
Mon Aug 2 22:29:08 CEST 2010 [seqfan] Re: A combinatorial problem
Mon Aug 2 22:10:12 CEST 2010 [seqfan] Re: A combinatorial problem
Mon Aug 2 21:46:34 CEST 2010 [seqfan] Re: A combinatorial problem
Mon Aug 2 21:43:41 CEST 2010 [seqfan] Re: A combinatorial problem
Mon Aug 2 20:27:43 CEST 2010 [seqfan] Re: A combinatorial problem
Mon Aug 2 11:11:08 CEST 2010 [seqfan] A combinatorial problem
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.