login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262678 a(n) = n - A262690(n), where A262690(n) = largest square k <= n such that A002828(n-k) = A002828(n)-1. 3
0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 8, 4, 5, 6, 0, 1, 9, 10, 4, 5, 13, 14, 8, 0, 1, 2, 3, 4, 5, 6, 16, 8, 9, 10, 0, 1, 2, 3, 4, 16, 17, 18, 8, 9, 10, 11, 32, 0, 1, 2, 16, 4, 5, 6, 20, 8, 9, 10, 11, 25, 13, 14, 0, 1, 2, 18, 4, 5, 34, 22, 36, 9, 25, 26, 40, 13, 29, 30, 16, 0, 1, 2, 20, 4, 5, 6, 52, 25, 9, 10, 11, 29, 13, 14, 32, 16, 49, 18, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..65536

FORMULA

a(n) = n - A262690(n).

PROG

(Scheme) (define (A262678 n) (- n (A262690 n)))

CROSSREFS

Cf. A002828, A262689, A262690.

Cf. also A053186.

Sequence in context: A066628 A255120 A218601 * A238794 A135317 A227179

Adjacent sequences:  A262675 A262676 A262677 * A262679 A262680 A262681

KEYWORD

nonn

AUTHOR

Antti Karttunen, Oct 03 2015

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 October 17 11:47 EDT 2019. Contains 328108 sequences. (Running on oeis4.)