login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
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, 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, 91, 74, 0, 85, 25, 0, 40, 87, 100, 119, 93, 0, 111, 0, 117, 109, 94, 83, 97, 31, 17, 51, 102, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

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

LINKS

Table of n, a(n) for n=0..77.

PROG

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

CROSSREFS

Cf. A294673.

Sequence in context: A305223 A316801 A143044 * A127775 A210953 A254280

Adjacent sequences:  A305148 A305149 A305150 * A305152 A305153 A305154

KEYWORD

nonn

AUTHOR

P. Michael Hutchins, May 26 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 3 14:34 EDT 2020. Contains 333197 sequences. (Running on oeis4.)