a(n) is the smallest period of pseudo-arithmetic progression with initial term 1 and difference 2n-1
1, 1, 2, 1, 3, 5, 6, 1, 4, 9, 2, 4, 10, 9, 14, 1, 5, 5, 18, 4, 10, 7, 5, 9, 10, 2, 26, 8, 9, 29
9 seqfan posts
Sat Jul 24 05:41:58 CEST 2010 [seqfan] Re: An algorithm of calculation of multiplicative order of 2 mod n
Sat Jul 24 05:38:04 CEST 2010 [seqfan] Re: An algorithm of calculation of multiplicative order of 2 mod n
Mon Jul 19 10:27:05 CEST 2010 [seqfan] Re: Pseudo-arithmetic progressions
Sun Jul 18 20:34:23 CEST 2010 [seqfan] Re: Pseudo-arithmetic progressions
Fri Jul 16 20:59:55 CEST 2010 [seqfan] Re: Pseudo-arithmetic progressions
Wed Jul 14 21:34:44 CEST 2010 [seqfan] Re: Pseudo-arithmetic progressions
Mon Jul 12 19:15:56 CEST 2010 [seqfan] Re: Pseudo-arithmetic progressions
Mon Jul 12 17:01:22 CEST 2010 [seqfan] Re: Pseudo-arithmetic progressions
Mon Jul 12 16:25:10 CEST 2010 [seqfan] Pseudo-arithmetic progressions
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
.