The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A330086

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A330086

Least positive integer k such that A014577(k - 1) != A014577(n + k - 1).
(history; published version)

#16 by Peter Luschny at Tue Dec 03 05:12:23 EST 2019

STATUS

proposed

approved

#15 by Peter Luschny at Tue Dec 03 02:58:18 EST 2019

STATUS

editing

proposed

#14 by Peter Luschny at Tue Dec 03 02:57:07 EST 2019

LINKS

Peter Luschny, <a href="/A330086/b330086.txt">Table of n, a(n) for n = 1..1000</a>

STATUS

approved

editing

#13 by Peter Luschny at Mon Dec 02 15:27:25 EST 2019

STATUS

proposed

approved

#12 by Peter Luschny at Mon Dec 02 15:07:03 EST 2019

STATUS

editing

proposed

#11 by Peter Luschny at Mon Dec 02 15:06:48 EST 2019

NAME

Least positive integer i k such that A014577(i k - 1) != A014577(n +i k - 1).

MAPLE

with(ListTools): with(numtheory):

J := (n, k) -> jacobi(-1, k) <> jacobi(-1, n+k):

a := n -> SelectFirst(k -> J(n, k), [seq(k, k=1..100000)]):

seq(a(n), n=1..86); # Peter Luschny, Dec 02 2019

STATUS

approved

editing

#10 by N. J. A. Sloane at Mon Dec 02 14:04:47 EST 2019

STATUS

proposed

approved

#9 by Jeppe Stig Nielsen at Sun Dec 01 17:15:49 EST 2019

STATUS

editing

proposed

Discussion

Mon Dec 02

06:00

Jeffrey Shallit: Sorry, the "usual" way to index the paperfolding words in the literature is to start with index 1.   But the OEIS indexes it starting at position 0 instead.  Thanks for your fix.

#8 by Jeppe Stig Nielsen at Sun Dec 01 17:09:53 EST 2019

NAME

Least positive integer i such that A014577(i - 1) != A014577(n+i - 1).

STATUS

proposed

editing

Discussion

Sun Dec 01

17:14

Jeppe Stig Nielsen: I think my edit fixed that.

#7 by Michael De Vlieger at Sun Dec 01 16:01:38 EST 2019

STATUS

editing

proposed

Discussion

Sun Dec 01

17:04

Jeppe Stig Nielsen: I also get 1, 2, 3, 1, 1, 2, 2, 3, 1, 1, 3, 1, 1, 2, 2, 7, 1, …, like Michel. As an example, let me evaluate a(1). So the least positive i so that A014577(i) != A014577(1+i). I try i=1 first. A014577(1) = 1 != 0 = A014577(2) = A014577(1+1). So i=1 works. So a(1)=1.