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!)
A175077 Final number reached by iterating r -> A049711(r) starting at r = n. 4
1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
See A175071 for starting n that reach 1, and A175072 for starting n that reach 2.
LINKS
FORMULA
a(A175071(k)) = 1; a(A175072(k)) = 2, any k. - R. J. Mathar, Feb 19 2010
a(n) = A121559(n-1) + 1 for n >= 2. - Pontus von Brömssen, Jul 31 2022
EXAMPLE
Iteration procedure for n = 6: 6 mod 5 = 1 = a(6).
Iteration procedure for n = 7: 7 mod 5 = 2 = a(7).
MAPLE
A151799 := proc(n) prevprime(n) ; end proc:
A049711 := proc(n) if n <=2 then n; else n-A151799(n) ; end if; end proc:
A175077 := proc(n) local r ; r := n ; while r > 2 do r := A049711(r) ; end do: r ; end proc:
seq(A175077(n), n=1..100) ; # R. J. Mathar, Feb 19 2010
MATHEMATICA
f[n_] := Switch[n, 1, 1, 2, 2, _, n - NextPrime[n, -1]];
a[n_] := FixedPoint[f, n];
Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Jun 13 2023 *)
CROSSREFS
Sequence in context: A279044 A134265 A182858 * A001030 A246140 A071709
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Jan 23 2010
EXTENSIONS
More terms from R. J. Mathar, Feb 19 2010
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 July 23 20:47 EDT 2024. Contains 374565 sequences. (Running on oeis4.)