Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022856
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022856 a(n) = n-2 + Sum of a(i+1)mod(a(i)) for i = 1 to n-2, for n >= 3. +0
7
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; listen)
OFFSET

1,4

COMMENT

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

FORMULA

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

CROSSREFS

Sequence in context: A004170 A028955 A104664 this_sequence A089071 A061535 A129504

Adjacent sequences: A022853 A022854 A022855 this_sequence A022857 A022858 A022859

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research