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!)
A177046 a(n) = 127*(n-1)-a(n-1) with n>1, a(1)=16. 4

%I #27 Feb 28 2023 03:27:13

%S 16,111,143,238,270,365,397,492,524,619,651,746,778,873,905,1000,1032,

%T 1127,1159,1254,1286,1381,1413,1508,1540,1635,1667,1762,1794,1889,

%U 1921,2016,2048,2143,2175,2270,2302,2397,2429,2524,2556,2651,2683,2778,2810,2905,2937,3032,3064

%N a(n) = 127*(n-1)-a(n-1) with n>1, a(1)=16.

%C Positive numbers k such that k^2 == 2 (mod 127).

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

%F a(n) = (127-63*(-1)^(n-1)+254*(n-1))/4.

%F a(n) = a(n-1)+a(n-2)-a(n-3).

%F G.f.: x*(16+95*x+16*x^2) / ( (1+x)*(x-1)^2 ). - _R. J. Mathar_, Aug 24 2011

%F Sum_{n>=1} (-1)^(n+1)/a(n) = cot(16*Pi/127)*Pi/127. - _Amiram Eldar_, Feb 28 2023

%t LinearRecurrence[{1,1,-1},{16,111,143},50] (* _Harvey P. Dale_, May 30 2014 *)

%o (Magma) [(127-63*(-1)^(n-1)+254*(n-1))/(4): n in [1..50]]

%K nonn,easy

%O 1,1

%A _Vincenzo Librandi_, Dec 09 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 March 29 06:15 EDT 2024. Contains 371265 sequences. (Running on oeis4.)