[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A082675 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A082675 Constant term when a polynomial of degree <= n is fitted to the first n+1 upper members of the twin prime pairs.
(history; published version)
#19 by OEIS Server at Fri Jun 14 10:06:47 EDT 2024
LINKS

Robert Israel, <a href="/A082675/b082675_1.txt">Table of n, a(n) for n = 1..1000</a>

#18 by Alois P. Heinz at Fri Jun 14 10:06:47 EDT 2024
STATUS

proposed

approved

Discussion
Fri Jun 14 10:06
OEIS Server: Installed first b-file as b082675.txt.
#17 by Robert Israel at Fri Jun 14 09:41:25 EDT 2024
STATUS

editing

proposed

#16 by Robert Israel at Fri Jun 14 09:41:20 EDT 2024
EXTENSIONS

Definition edited by Robert Israel, Jun 14 2024

STATUS

proposed

editing

#15 by Robert Israel at Fri Jun 14 09:36:11 EDT 2024
STATUS

editing

proposed

#14 by Robert Israel at Fri Jun 14 09:36:00 EDT 2024
NAME

Constant term when a polynomial of degree <= n is fitted to the first n+1 upper members of the twin prime pairs.

STATUS

proposed

editing

#13 by Robert Israel at Mon Jun 10 19:36:22 EDT 2024
STATUS

editing

proposed

Discussion
Wed Jun 12 17:26
N. J. A. Sloane: Yes, good suggestion!  Please make that change!
#12 by Robert Israel at Mon Jun 10 19:35:09 EDT 2024
LINKS

Robert Israel, <a href="/A082675/b082675_1.txt">Table of n, a(n) for n = 1..1000</a>

STATUS

approved

editing

Discussion
Mon Jun 10 19:36
Robert Israel: Should the Name say "degree <= n"?  AFAIK there is no guarantee that the coefficient of x^n will be nonzero.
#11 by Jon E. Schoenfield at Fri Aug 07 03:06:39 EDT 2015
STATUS

editing

approved

#10 by Jon E. Schoenfield at Fri Aug 07 03:06:37 EDT 2015
MAPLE

A006512 := proc(n) local i, p ; i := 1 ; p := 0 ; while true do while ithprime(i+1)-ithprime(i) <> 2 do i := i+1 ; od ; p := p+1 ; if p = n then RETURN( ithprime(i+1) ) ; fi ; i := i+1 ; od ; end: A082675 := proc(n) local rhs, co, row, col; rhs := linalg[vector](n+1) ; co := linalg[matrix](n+1, n+1) ; for row from 1 to n+1 do rhs[row] := A006512(row) ; for col from 1 to n+1 do co[row, col] := row^(col-1) ; od ; od ; linalg[linsolve](co, rhs)[1] ; end: for n from 1 to 30 do printf("%d, ", A082675(n)) ; od ; - _ ; # _R. J. Mathar_, Oct 31 2006

STATUS

approved

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)