The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A006190

a(n) = 3*a(n-1) + a(n-2), with a(0)=0, a(1)=1.
(history; published version)

#322 by Alois P. Heinz at Thu Aug 22 17:39:31 EDT 2024

STATUS

proposed

approved

#321 by Michael De Vlieger at Thu Aug 22 17:38:27 EDT 2024

STATUS

editing

proposed

#320 by Michael De Vlieger at Thu Aug 22 17:38:24 EDT 2024

LINKS

Prabha Sivaraman Nair and Rejikumar Karunakaran, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL27/Nair/nair11.html">On k-Fibonacci Brousseau Sums</a>, J. Int. Seq. (2024) Art. No. 24.6.4. See p. 2.

STATUS

approved

editing

#319 by Amiram Eldar at Fri Aug 02 06:55:57 EDT 2024

STATUS

reviewed

approved

#318 by Joerg Arndt at Fri Aug 02 06:28:37 EDT 2024

STATUS

proposed

reviewed

#317 by Michel Marcus at Fri Aug 02 06:23:36 EDT 2024

STATUS

editing

proposed

#316 by Michel Marcus at Fri Aug 02 06:23:32 EDT 2024

COMMENTS

a(p) == 13^((p-1)/2) mod p, for odd primes p. - Gary W. Adamson, Feb 22 2009

FORMULA

a(p) == 13^((p-1)/2) mod p, for odd primes p. - Gary W. Adamson, Feb 22 2009

STATUS

proposed

editing

#315 by Jason Yuen at Fri Aug 02 04:48:01 EDT 2024

STATUS

editing

proposed

#314 by Jason Yuen at Fri Aug 02 04:47:15 EDT 2024

COMMENTS

a(p) == 13^((p-1)/2)) mod p, for odd primes p. - Gary W. Adamson, Feb 22 2009

STATUS

approved

editing

#313 by Michael De Vlieger at Fri May 17 10:19:12 EDT 2024

STATUS

reviewed

approved