login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022856 a(n) = n-2 + Sum of a(i+1) mod(a(i)) for i = 1 to n-2, for n >= 3. 15
1, 1, 1, 2, 3, 5, 8, 12, 17, 23, 30, 38, 47, 57, 68, 80, 93, 107, 122, 138, 155, 173, 192, 212, 233, 255, 278, 302, 327, 353, 380, 408, 437, 467, 498, 530, 563, 597, 632, 668, 705, 743, 782, 822, 863, 905, 948, 992, 1037, 1083, 1130, 1178, 1227 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Essentially triangular numbers + 2, but with three extra initial terms.

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..5000

Guo-Niu Han, Enumeration of Standard Puzzles [broken link]

Guo-Niu Han, Enumeration of Standard Puzzles [Cached copy]

Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

FORMULA

For n>3, a(n) = (n^2-7*n+16)/2 = A027689(n-4)/2 = A000217(n-4)+2 = A000124(n-4)+1. - Henry Bottomley, Jun 27 2000

a(n) = sum(A007318(n-k-2, k), k=0..2), n > 3. - Johannes W. Meijer, Aug 11 2013

MATHEMATICA

a[n_] := If[n<4, 1, (n^2-7n+16)/2]; Array[a, 60] (* Jean-Fran├žois Alcover, Mar 08 2017 *)

PROG

(PARI) for(n=1, 100, print1(if(n<4, 1, (n^2 - 7*n +16)/2), ", ")) \\ G. C. Greubel, Jul 13 2017

CROSSREFS

Sequence in context: A028955 A246321 A104664 * A089071 A177205 A275580

Adjacent sequences:  A022853 A022854 A022855 * A022857 A022858 A022859

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 19:23 EST 2020. Contains 332308 sequences. (Running on oeis4.)