Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033913
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033913 Numbers n such that s(n)+s(n+1)+...+s(n+6)=t(n)+t(n+1)+...+t(n+6). +0
1
5, 11, 19, 133, 465, 1361, 1693, 205021, 317293 (list; graph; listen)
OFFSET

1,1

FORMULA

Here s(n)=sigma(n)-n, t(n)=|s(n)-n|.

PROGRAM

(PARI) l=vector(7, n, abs(sigma(n)-2*n)-sigma(n)+n); l[7]=0; sc=sum(n=1, 7, l[n]); for(n=7, 1000000, m=sigma(n)-2*n; d=abs(m)-m-n; i=(n-1)%7+1; sc=sc-l[i]+d; l[i]=d; if(sc==0, print1(n-6, ", "))) (C. Ronaldo)

CROSSREFS

Sequence in context: A072743 A045452 A128927 this_sequence A088124 A029456 A110208

Adjacent sequences: A033910 A033911 A033912 this_sequence A033914 A033915 A033916

KEYWORD

nonn

AUTHOR

Naohiro Nomoto (6284968128(AT)geocities.co.jp)

EXTENSIONS

More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 02 2005

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research