The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A029898

Pitoun's sequence: a(n+1) is digital root of a(0) + ... + a(n).
(history; published version)

#51 by Joerg Arndt at Thu Dec 14 05:43:50 EST 2023

STATUS

proposed

approved

#50 by Paolo P. Lava at Thu Dec 14 05:41:52 EST 2023

STATUS

editing

proposed

#49 by Paolo P. Lava at Thu Dec 14 05:41:49 EST 2023

FORMULA

a(n) = (1/30)*(19*(n mod 6) + 14*((n+1) mod 6) - 11*((n+2) mod 6) - ((n+3) mod 6) + 4*((n+4) mod 6) + 29*((n+5) mod 6)) - 4*(C(2*n,n) mod 2), with n >= 0. - Paolo P. Lava, Mar 04 2010

STATUS

approved

editing

#48 by Michael De Vlieger at Mon Jun 27 08:49:35 EDT 2022

STATUS

reviewed

approved

#47 by Michel Marcus at Mon Jun 27 05:34:04 EDT 2022

STATUS

proposed

reviewed

#46 by Stefano Spezia at Mon Jun 27 05:25:39 EDT 2022

STATUS

editing

proposed

#45 by Stefano Spezia at Mon Jun 27 05:24:44 EDT 2022

FORMULA

E.g.f.: 5*cosh(x) + 4*(sinh(x) - 1) - 2*sqrt(3)*exp(x/2)*sin(sqrt(3)*x/2) + 4*(sinh(x) - 1). (End)

#44 by Stefano Spezia at Mon Jun 27 05:23:44 EDT 2022

FORMULA

From Stefano Spezia, Jun 27 2022: (Start)

O.g.f.: (1 + x^2 + 3*x^3 + 4*x^4)/((1 - x)*(1 + x)*(1 - x + x^2)).

E.g.f.: 5*cosh(x) + 4*(sinh(x) - 1) - 2*sqrt(3)*exp(x/2)*sin(sqrt(3)*x/2).(End)

STATUS

approved

editing

#43 by Michael De Vlieger at Thu Mar 03 11:29:20 EST 2022

STATUS

reviewed

approved

#42 by Joerg Arndt at Thu Mar 03 01:45:25 EST 2022

STATUS

proposed

reviewed