### References to hamilton

*14 seqfan posts*

*Mon Mar 19 19:28:35 CET 2012* [seqfan] Re: What is the name for a string that contains every k-digit base-b substring?

*Mon Mar 5 01:03:56 CET 2012* [seqfan] Re: Quick question about self-avoiding walks

*Mon Dec 12 04:50:08 CET 2011* [seqfan] Re: Quick question about self-avoiding walks

*Mon Dec 12 04:21:20 CET 2011* [seqfan] Re: Quick question about self-avoiding walks

*Mon Dec 12 04:15:26 CET 2011* [seqfan] Re: Quick question about self-avoiding walks

*Sat Dec 10 15:59:00 CET 2011* [seqfan] Re: Quick question about self-avoiding walks

*Sat Dec 10 15:56:21 CET 2011* [seqfan] Re: Quick question about self-avoiding walks

*Sat Dec 10 15:30:51 CET 2011* [seqfan] Re: Quick question about self-avoiding walks

*Sat Aug 7 19:21:18 CEST 2010* [seqfan] A combinatorial problem: generalization

*Tue Aug 3 16:36:38 CEST 2010* [seqfan] Re: A combinatorial problem

*Sat Mar 27 20:18:04 CET 2010* [seqfan] permutations p in S_n such that m <= |p(i)-p(i+1)| <=M for i from 1 to n-1.

*Tue Jun 9 09:48:51 CEST 2009* [seqfan] Re: functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)]

*Tue Jun 9 04:38:25 CEST 2009* [seqfan] functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)]

*Fri Dec 26 23:06:26 CET 2008* [seqfan] Some items inspired by appearances of 2009 in the OEIS

Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword

hamilton

Links to OEIS content are included according to
The OEIS End-User License Agreement
.