Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071934
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071934 a(n) = sum(i=1,n,K(i+1,i)) where K(x,y) is the Kronecker symbol (x/y). +0
1
1, 0, 1, 2, 3, 4, 5, 6, 7, 6, 7, 8, 9, 10, 11, 12, 13, 12, 13, 14, 15, 16, 17, 18, 19, 18, 19, 20, 21, 22, 23, 24, 25, 24, 25, 26, 27, 28, 29, 30, 31, 30, 31, 32, 33, 34, 35, 36, 37, 36, 37, 38, 39, 40, 41, 42, 43, 42, 43, 44, 45, 46, 47, 48, 49, 48, 49, 50, 51, 52, 53, 54, 55 (list; graph; listen)
OFFSET

1,4

FORMULA

a(n) = n - 2* ceil(n/8) + 2 if n == 1 (mod 8) a(n) = n - 2* ceil(n/8) otherwise

EXAMPLE

Because 53-1 = 52 is not congruent to 1 (mod 8); a(71) = 71 -2*ceil(71/8) = 71 - 2*9 = 71-18 = 53

PROGRAM

(PARI) for(n=1, 100, print1(sum(i=1, n, kronecker(i+1, i)), ", "))

CROSSREFS

Sequence in context: A161209 A000026 A005599 this_sequence A161658 A066853 A141258

Adjacent sequences: A071931 A071932 A071933 this_sequence A071935 A071936 A071937

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 14 2002

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research