Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054982
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054982 a(n)=Min[ x ], the least composite number such that Sigma[ a(n)+n! ]=n!+Sigma[ a(n) ] where Sigma()=A000203. +0
4
434, 104, 80, 182, 427, 1727, 4147, 7163, 42031, 165841, 569257, 2683909 (list; graph; listen)
OFFSET

2,1

EXAMPLE

a(7)=1727=11*157, 4 divisors, 5040+Sigma[1727]=1896+5040=6936, Sigma[1727+5040]=Sigma[6767]=1+67+101+6767=6936; a(2)=A054799(24)=434,a(3)=A015914(19)=104, the first composites in that series

MATHEMATICA

L = {}; Do[i = 1; While[ ! ((Plus @@ Divisors[i + j! ] == j! + Plus @@ Divisors[i]) && ! PrimeQ[i]), i++ ]; L = Append[L, i], {j, 2, 13}]; L (from Vit Planocka)

CROSSREFS

A054904, A054905, A054799, A015914, A033560.

Sequence in context: A059664 A108832 A055009 this_sequence A108785 A050507 A054987

Adjacent sequences: A054979 A054980 A054981 this_sequence A054983 A054984 A054985

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 29 2000

EXTENSIONS

More terms from Vit Planocka (planocka(AT)mistral.cz), Sep 22 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research