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!)
A078918 a(n) = (a(n-1) + a(n-3)) * a(n-2) / a(n-4). a(1) = a(2) = a(3) = a(4) = 1. 2
1, 1, 1, 1, 2, 3, 8, 30, 132, 1400, 23595, 1107260, 198172975, 156753667213, 1316573850509365, 186386043285609148267, 1238266675343181339894414632, 1472345944138437490816316070884292123 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
David Gale, Tracking the Automatic Ant, Chapter 1.
FORMULA
a(n) * a(n-6) = (a(n-1) + a(n-3)) * (a(n-3) + a(n-5)) for all n in Z. - Michael Somos, Dec 25 2013
a(5-n) = a(n) for all n in Z. - Michael Somos, Dec 25 2013
a(n) = 6 * a(n-2) * a(n-3) - (a(n-2) + a(n-3) + a(n-5)) for all n in Z. - Michael Somos, May 30 2022
MATHEMATICA
a[ n_] := a[n] = If[n < 1, a[5 - n], If[n < 5, 1, (a[n - 1] + a[n - 3]) a[n - 2] / a[n - 4]]]; (* Michael Somos, Dec 25 2013 *)
a[ n_] := a[n] = If[n < 1, a[5 - n], If[n < 6, Max[1, n - 3], 6*a[n - 2]*a[n-3] - (a[n - 2] + a[n - 3] + a[n - 5])]]; (* Michael Somos, May 30 2022 *)
PROG
(PARI) {a(n) = if( n<1, n = 5-n); if( n<5, 1, (a(n-1) + a(n-3)) * a(n-2) / a(n-4))}; /* Michael Somos, Dec 25 2013 */
(PARI) {a(n) = if( n<1, n = 5-n); if( n<6, max(1, n-3), 6*a(n-2)*a(n-3) - (a(n-2)+a(n-3)+a(n-5)))}; /* Michael Somos, May 30 2022 */
CROSSREFS
Cf. A078919.
Sequence in context: A332030 A188498 A012886 * A054104 A053556 A301737
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Dec 13 2002
STATUS
approved

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 April 23 19:56 EDT 2024. Contains 371916 sequences. (Running on oeis4.)