Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086986
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086986 Numbers n such that sigma(n) can be represented as sum{i=0,k, sigma(m+i)}, with k>0. +0
2
3, 4, 7, 8, 9, 10, 12, 13, 16, 17, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 75, 76, 77, 78, 81, 82, 83, 84, 85, 86, 87, 89 (list; graph; listen)
OFFSET

1,1

COMMENT

Is it true that every integer n ultimately has sigma(n) representable like this?

EXAMPLE

sigma(61)=62=sigma(13)+sigma(14)+sigma(15)=14+24+24

PROGRAM

(PARI) { s=vector(1000); sc=0; for (k=1, 10, for (i=1, 100, s[sc++ ]=sum(j=0, k, sigma(i+j)))); s=vecsort(s); s } for (i=2, 100, for (j=1, 1000, if (sigma(i)==s[j], print1(i", "); break)))

CROSSREFS

Cf. A086987 gives values of sigma.

Sequence in context: A056007 A104426 A097044 this_sequence A057811 A026343 A080722

Adjacent sequences: A086983 A086984 A086985 this_sequence A086987 A086988 A086989

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Jul 27 2003

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research