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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286387 a(n) = A002487(n^2). 2
0, 1, 1, 4, 1, 7, 4, 9, 1, 14, 7, 13, 4, 29, 9, 16, 1, 23, 14, 43, 7, 36, 13, 29, 4, 43, 29, 64, 9, 67, 16, 25, 1, 34, 23, 89, 14, 115, 43, 46, 7, 85, 36, 79, 13, 46, 29, 79, 4, 97, 43, 142, 29, 89, 64, 91, 9, 136, 67, 157, 16, 121, 25, 36, 1, 47, 34, 151, 23, 236, 89, 157, 14, 211, 115, 104, 43, 225, 46, 109, 7, 162, 85, 235, 36, 139, 79, 174, 13, 101, 46 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Conjecture: For all i >= 0, j >= 0: A103391(1+i) = A103391(1+j) => a(i) = a(j). This would be an implication of observation made at A286377, which has been checked up to n=2048. See also A286378.

LINKS

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

Index entries for sequences related to Stern's sequences

FORMULA

a(n) = A002487(A000290(n)) = A002487(n^2).

PROG

(Scheme) (define (A286387 n) (A002487 (* n n)))

CROSSREFS

Cf. A000290, A002487, A103391, A286377, A286378.

Sequence in context: A143972 A019651 A262606 * A094649 A135857 A156558

Adjacent sequences:  A286384 A286385 A286386 * A286388 A286389 A286390

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 09 2017

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 25 20:40 EST 2018. Contains 299656 sequences. (Running on oeis4.)