|
Search: id:A125717
|
|
|
| A125717 |
|
a(1)=1. a(n) = the smallest positive integer not occurring earlier in the sequence such that a(n-1) is congruent to a(n) (mod n). |
|
+0
2
|
|
| 1, 3, 6, 2, 7, 13, 20, 4, 22, 12, 23, 11, 24, 10, 25, 9, 26, 8, 27, 47, 5, 49, 72, 48, 73, 21, 75, 19, 77, 17, 79, 15, 81, 115, 45, 117, 43, 119, 41, 121, 39, 123, 37, 125, 35, 127, 33, 129, 31, 131, 29, 133, 80, 134, 189, 245, 74, 16, 193, 253, 70, 132, 69, 197, 67, 199, 65
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This sequence seems likely to be a permutation of the positive integers.
|
|
LINKS
|
Ferenc Adorjan, Table of n,a(n) for n=1,10000
Ferenc Adorjan, Some characteristics of Leroy Quet's permutation sequences
|
|
MATHEMATICA
|
f[l_List] := Block[{n = Length[l] + 1, k = Mod[l[[ -1]], n, 1]}, While[MemberQ[l, k], k += n]; Append[l, k]]; Nest[f, {1}, 70] (*Chandler*)
|
|
PROGRAM
|
(PARI) {Quet_p2(n)=/* Permutation sequence a'la Leroy Quet, A125717 */local(x=[1], k=0, w=1); for(i=2, n, if((k=x[i-1]%i)==0, k=i); while(bittest(w, k-1)>0, k+=i); x=concat(x, k); w+=2^(k-1)); return(x)} [Ferenc Adorjan]
|
|
CROSSREFS
|
Sequence in context: A105332 A072007 A078783 this_sequence A065232 A074170 A076543
Adjacent sequences: A125714 A125715 A125716 this_sequence A125718 A125719 A125720
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Feb 01 2007
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 04 2007
|
|
|
Search completed in 0.002 seconds
|
