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!)
A305151 a(n) = (2n+1) - A294673(n), the amount by which A294673 is less than the maximum possible for n. 0

%I #11 May 26 2018 17:28:36

%S 0,0,0,3,0,0,4,10,5,7,14,0,17,7,0,25,0,0,17,0,0,15,33,11,34,0,0,19,13,

%T 35,41,56,0,31,0,11,31,60,57,27,0,0,76,27,0,31,53,0,85,0,17,37,0,79,

%U 91,74,0,85,25,0,40,87,100,119,93,0,111,0,117,109,94,83,97,31,17,51,102,0

%N a(n) = (2n+1) - A294673(n), the amount by which A294673 is less than the maximum possible for n.

%C Motivation: A294673(n), which is always <= 2n+1, equals n in most cases. This sequence abstracts out that commonality to leave a cleaner signal.

%o (PARI) a(n) = (2*n+1) - znorder(Mod(if(n%2, 2, -2), 4*n+3)); \\ _Michel Marcus_, May 26 2018

%Y Cf. A294673.

%K nonn

%O 0,4

%A _P. Michael Hutchins_, May 26 2018

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 18 10:01 EDT 2024. Contains 371779 sequences. (Running on oeis4.)