login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A288036 Numbers x such that the trajectory of x under the map x -> A090086(x) does not enter the cycle {14, 15}. 0
38, 39, 40, 220, 248, 508, 623, 662, 688, 723, 740, 742, 875, 898, 922, 950, 1078, 1103, 1130, 1179, 1208, 1262, 1312, 1390, 1598, 1600, 1635, 1652, 1678, 1780, 1787, 2027, 2198, 2319, 2378, 2380, 2495, 2547, 2560, 2588, 2770, 2775, 2900, 2950, 2963, 3003 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..46.

EXAMPLE

The trajectory of 220 enters the cycle {38, 39} after one step, so 220 is a term of the sequence.

MATHEMATICA

Select[Range@ 3000, Function[k, ! MemberQ[NestWhileList[Function[n, Block[{j = 1}, While[GCD[n, j] > 1 || PrimeQ@ j || PowerMod[n, j - 1, j] != 1, i = j++]; j]], k, # != 15 &, 1, 100], 15]]] (* Michael De Vlieger, Jun 06 2017, after Robert G. Wilson v at A090086 *)

PROG

(PARI) a090086(n) = forcomposite(c=1, , if(Mod(n, c)^(c-1)==1, return(c)))

trajectory(n, terms) = my(v=[n]); while(#v < terms, v=concat(v, a090086(v[#v]))); v

is(n) = my(len=2, t=trajectory(n, len), k=#t); while(1, k--; if(t[k]==t[#t], if(t[#t]!=14 && t[#t]!=15, return(1), return(0))); if(k==1, len++; t=trajectory(n, len); k=#t))

CROSSREFS

Cf. A090086.

Sequence in context: A165859 A341708 A031958 * A350854 A272035 A056027

Adjacent sequences:  A288033 A288034 A288035 * A288037 A288038 A288039

KEYWORD

nonn

AUTHOR

Felix Fröhlich, Jun 04 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 21:51 EDT 2022. Contains 356949 sequences. (Running on oeis4.)