A329471 - OEIS

Draft edits for A329471

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)

This sequence contains draft edits but has not been submitted for review.
To submit the changes for review, click the button at the bottom.

A329471

a(n) = a(n-1)^2 + 3 for n >=2 , where a(0) = 1, a(1) = 3.
(history; published version)

Individual edits:

#9 by Peter Bala at Fri Jul 10 06:03:20 EDT 2026

REFERENCES

KEYWORD

nonn

STATUS

approved

#10 by Peter Bala at Fri Jul 10 15:41:03 EDT 2026

NAME

a(n) = a(n-1)^2 + 3 for n >=2 , where a(0) = 1, a(1) = 3.

CROSSREFS

Cf. A329433.

#11 by Peter Bala at Sat Jul 11 04:59:13 EDT 2026

REFERENCES

L. E. Dickson, History of the Theory of Numbers, vol. 1, Chelsea, New York, 1952, p. 403.

#12 by Peter Bala at Thu Jul 16 06:45:55 EDT 2026

COMMENTS

#13 by Peter Bala at Sun Jul 19 16:45:31 EDT 2026

COMMENTS

For k >= 1, the sequences {a(n+k) - a(k) : n >= 1} and {a(n+k) + a(k): k >= 1} are also strong divisibility sequences. - Peter Bala, Jul 16 2026

LINKS

All edits since published version (omitting small deletions for readability):

NAME

a(n) = a(n-1)^2 + 3 for n >=2 , where a(0) = 1, a(1) = 3.

DATA

1, 3, 12, 147, 21612, 467078547, 218162369067631212, 47594819277201331861096436836588947, 2265266822029455509816214491130485582138030749246532017266850242568812

OFFSET

0,2

COMMENTS

(a(n)) is a strong divisibility sequence.

REFERENCES

LINKS

FORMULA

a(n) = p(n,0), where p(n,x) is polynomial defined in