This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262690 a(n) = largest square k <= n such that A002828(n-k) = A002828(n)-1. 4
 0, 1, 1, 1, 4, 4, 4, 4, 4, 9, 9, 9, 4, 9, 9, 9, 16, 16, 9, 9, 16, 16, 9, 9, 16, 25, 25, 25, 25, 25, 25, 25, 16, 25, 25, 25, 36, 36, 36, 36, 36, 25, 25, 25, 36, 36, 36, 36, 16, 49, 49, 49, 36, 49, 49, 49, 36, 49, 49, 49, 49, 36, 49, 49, 64, 64, 64, 49, 64, 64, 36, 49, 36, 64, 49, 49, 36, 64, 49, 49, 64, 81, 81, 81, 64, 81, 81, 81, 36, 64, 81, 81, 81, 64, 81, 81, 64, 81, 49, 81, 100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Antti Karttunen, Table of n, a(n) for n = 0..65536 FORMULA a(n) = A000290(A262689(n)). Other identities. For all n >= 0: A262678(n) = n - a(n). PROG (Scheme) (define (A262690 n) (A000290 (A262689 n))) CROSSREFS Cf. A000290, A002828, A262689, A262678. Cf. also A048760. Sequence in context: A064053 A108893 A162281 * A048760 A287392 A035627 Adjacent sequences:  A262687 A262688 A262689 * A262691 A262692 A262693 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.

Last modified October 15 23:54 EDT 2019. Contains 328038 sequences. (Running on oeis4.)