The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A215964

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

A215964

Prime tribonacci non-divisors.
(history; published version)

#15 by Alois P. Heinz at Fri Feb 21 20:09:58 EST 2020

STATUS

editing

approved

#14 by Alois P. Heinz at Fri Feb 21 20:09:56 EST 2020

LINKS

Project Euler, <a href="httphttps://projecteuler.net/problem=225">Problem #225: Tribonacci non-divisors</a>

STATUS

approved

editing

#13 by Charles R Greathouse IV at Mon May 13 01:54:22 EDT 2013

LINKS

V. Raman and _Charles R Greathouse IV_, , <a href="/A215964/b215964.txt">Table of n, a(n) for n = 1..1000</a> (first 107 terms from Raman)

Discussion

Mon May 13

01:54

OEIS Server: https://oeis.org/edit/global/1915

#12 by Charles R Greathouse IV at Mon May 13 01:50:07 EDT 2013

LINKS

V. Raman and _Charles R Greathouse IV, _, <a href="/A215964/b215964.txt">Table of n, a(n) for n = 1..1000</a> (first 107 terms from Raman)

Discussion

Mon May 13

01:50

OEIS Server: https://oeis.org/edit/global/1914

#11 by OEIS Server at Wed Aug 29 12:00:46 EDT 2012

LINKS

V. Raman and Charles R Greathouse IV, <a href="/A215964/b215964_1.txt">Table of n, a(n) for n = 1..1000</a> (first 107 terms from Raman)

#10 by N. J. A. Sloane at Wed Aug 29 12:00:46 EDT 2012

STATUS

proposed

approved

Discussion

Wed Aug 29

12:00

OEIS Server: Installed new b-file as b215964.txt.  Old b-file is now b215964_1.txt.

#9 by Charles R Greathouse IV at Wed Aug 29 11:12:05 EDT 2012

STATUS

editing

proposed

#8 by Charles R Greathouse IV at Wed Aug 29 11:12:01 EDT 2012

LINKS

Project Euler, <a href="http://projecteuler.net/problem=225">Problem #225</a>

#7 by Charles R Greathouse IV at Wed Aug 29 11:11:44 EDT 2012

LINKS

V. Raman, and Charles R Greathouse IV, <a href="/A215964/b215964_1.txt">Table of n, a(n) for n = 1..1000</a> (first 107</a> terms from Raman)

PROG

(PARI) is(n)=my(a=1, b=1, c=1, t); for(i=1, n^2, t=(a+b+c)%n; if(t, a=b; b=c; c=t, return(0)); if(c==1&&b==1&&a==1, return(isprime(n)))) \\ Charles R Greathouse IV, Aug 29 2012

STATUS

proposed

editing

#6 by V. Raman at Wed Aug 29 09:48:38 EDT 2012

STATUS

editing

proposed

Discussion

Wed Aug 29

10:09

V. Raman: I uploaded the b-file with 107 terms, but the OEIS software automatically rendered / filled with the MIN..MAX values to be 1 through 106, is it there being a possible OEIS software bug cause / crash them, , away, alone,

10:15

Charles R Greathouse IV: You probably aren't following the b-file format correctly. The file should end with a newline character; if not, the server will misread the length of the file by 1. See
https://oeis.org/wiki/User:Charles_R_Greathouse_IV/Format#b-files