[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 A324471 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A324471 a(n) = 10 mod n.
(history; published version)
#24 by Alois P. Heinz at Sat Aug 03 18:16:23 EDT 2024
STATUS

proposed

approved

#23 by Elmo R. Oliveira at Sat Aug 03 18:13:12 EDT 2024
STATUS

editing

proposed

#22 by Elmo R. Oliveira at Sat Aug 03 18:12:12 EDT 2024
FORMULA

From Elmo R. Oliveira, Aug 03 2024: (Start)

G.f.: x^3*(1 + x - 2*x^2 + 4*x^3 - x^4 - x^5 - x^6 - x^7 + 10*x^8)/(1 - x).

a(n) = 10 for n > 10. (End)

STATUS

approved

editing

#21 by Michael De Vlieger at Tue Nov 14 09:16:26 EST 2023
STATUS

reviewed

approved

#20 by Michel Marcus at Tue Nov 14 08:14:54 EST 2023
STATUS

proposed

reviewed

#19 by Alois P. Heinz at Tue Nov 14 08:08:05 EST 2023
STATUS

editing

proposed

#18 by Alois P. Heinz at Tue Nov 14 08:08:02 EST 2023
CROSSREFS

Cf. A010692, A010879, A048158, A051127, A090976, A324472.

STATUS

proposed

editing

#17 by Alois P. Heinz at Tue Nov 14 08:05:57 EST 2023
STATUS

editing

proposed

#16 by Alois P. Heinz at Tue Nov 14 08:05:43 EST 2023
LINKS

<a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).

KEYWORD

nonn,easy,changed

#15 by Alois P. Heinz at Tue Nov 14 08:03:14 EST 2023
CROSSREFS

Cf. A010692, A048158, A051127, A090976, A324472.

STATUS

reviewed

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 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)