[go: up one dir, main page]

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!)
A079354 a(1)=1; a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+3 otherwise. 3

%I #18 Mar 26 2024 10:29:51

%S 1,4,7,6,9,8,7,6,5,8,11,14,17,16,19,18,17,16,15,18,21,24,27,26,29,28,

%T 27,26,25,28,31,34,37,36,39,38,37,36,35,38,41,44,47,46,49,48,47,46,45,

%U 48,51,54,57,56,59,58,57,56,55,58,61,64,67,66,69,68,67,66,65,68,71,74,77

%N a(1)=1; a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.

%C Starting with a(1)=0 and same definition, a(n)=n+(-1)^n (cf. A004442)

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,1,-1).

%F a(n)-n is periodic with period (0, 2, 4, 2, 4, 2, 0, -2, -4, -2) of length 10.

%F a(10t+i) = 10t+c_i, 1<=i<=10, c_i=(1, 4, 7, 6, 9, 8, 7, 6, 5, 8). a(n) = n iff n == 1 or 7 (mod 10).

%F G.f.: x*(2*x^10+3*x^9-x^8-x^7-x^6-x^5+3*x^4-x^3+3*x^2+3*x+1) / (x^11-x^10-x+1). - _Colin Barker_, Oct 16 2013

%t LinearRecurrence[{1,0,0,0,0,0,0,0,0,1,-1},{1,4,7,6,9,8,7,6,5,8,11},80] (* _Harvey P. Dale_, Feb 01 2015 *)

%o (PARI) Vec(x*(2*x^10+3*x^9-x^8-x^7-x^6-x^5+3*x^4-x^3+3*x^2+3*x+1)/(x^11-x^10-x+1) + O(x^100)) \\ _Colin Barker_, Oct 16 2013

%K nonn,easy

%O 1,2

%A _Benoit Cloitre_ and _N. J. A. Sloane_, Feb 14 2003

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 August 29 18:55 EDT 2024. Contains 375518 sequences. (Running on oeis4.)