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!)
A175856 a(n) = a(n-1) - 1 if n is composite, a(n) = n otherwise. 9

%I #43 Dec 10 2023 18:03:03

%S 1,2,3,2,5,4,7,6,5,4,11,10,13,12,11,10,17,16,19,18,17,16,23,22,21,20,

%T 19,18,29,28,31,30,29,28,27,26,37,36,35,34,41,40,43,42,41,40,47,46,45,

%U 44,43,42,53,52,51,50,49,48,59,58,61,60,59,58,57,56,67,66

%N a(n) = a(n-1) - 1 if n is composite, a(n) = n otherwise.

%C a(n) = n for noncomposite n, a(n) = 2 * (previous prime (n)) - n for composite n.

%C See A175859 - absent positive integers (pairs of consecutive numbers) in sequence: 8, 9, 14, 15, 24, 25, 32, 33, ...

%C a(n) = A075365(n) except at n = 1 and n = 10. - _Alexandre Herrera_, Nov 11 2023

%H Alois P. Heinz, <a href="/A175856/b175856.txt">Table of n, a(n) for n = 1..10000</a>

%e a(7) = 7 (7 is a noncomposite number), a(8) = 2*7 - 8 = 6 (8 is composite).

%p a:= proc(n) option remember;

%p `if`(n=1 or isprime(n), n, a(n-1)-1)

%p end:

%p seq(a(n), n=1..80); # _Alois P. Heinz_, Jun 22 2021

%t a[1] := 1; a[n_] := a[n] = If[PrimeQ[n], n, a[n - 1] - 1] (* _Ben Branman_, Jan 02 2011 *)

%t nxt[{n_,a_}]:={n+1,If[CompositeQ[n+1],a-1,n+1]}; NestList[nxt,{1,1},70][[All,2]] (* _Harvey P. Dale_, Jan 01 2023 *)

%o (PARI) a(n)=if(n==1, 1, 2*precprime(n)-n) \\ _Charles R Greathouse IV_, Apr 22 2022~

%Y Cf. A002808, A008578, A175857, A175858, A175859, A175860, A175861, A175862, A075365.

%K nonn,easy

%O 1,2

%A _Jaroslav Krizek_, Sep 29 2010

%E Corrected by _Jaroslav Krizek_, Oct 01 2010

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 April 27 16:49 EDT 2024. Contains 372020 sequences. (Running on oeis4.)