Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053051
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053051 Smallest integer m such that sum_(k=1 to m) d(k) is divisible by n, where d(k) (A000005) is the number of divisors of k. +0
1
1, 4, 2, 4, 3, 19, 6, 4, 10, 5, 20, 19, 17, 6, 15, 7, 32, 48, 23, 8, 24, 20, 9, 42, 16, 17, 10, 24, 11, 19, 46, 41, 20, 43, 12, 164, 13, 23, 63, 41, 14, 24, 76, 44, 15, 80, 47, 108, 67, 16, 96, 17, 109, 164, 121, 42, 86, 18, 89, 19, 132, 46, 235, 149, 150, 20, 49, 281, 50 (list; graph; listen)
OFFSET

1,2

REFERENCES

Felice Russo, A set of new Smarandache functions, sequences and conjectures in number theory, American Research Press 2000

LINKS

Matthew M. Conroy, Home page (listed instead of email address)

M. L. Perez et al., eds., Smarandache Notions Journal

F. Russo, A set of new Smarandache functions, sequences and conjectures in number theory.

EXAMPLE

a(1)=1 since 1 has 1 divisor; a(3)=2 since 1 has 1 divisor, 2 has 2 divisors, and 1+2=3; a(2)=4 since 1+2+2+3=8, a multiple of 4, while 1, 1+2, and 1+2+2 are not multiples of 4.

CROSSREFS

Cf. A000005, A002034, A011772, A006218.

Sequence in context: A083954 A038702 A085062 this_sequence A075234 A095382 A135282

Adjacent sequences: A053048 A053049 A053050 this_sequence A053052 A053053 A053054

KEYWORD

easy,nice,nonn

AUTHOR

Felice Russo (felice.russo(AT)katamail.com), Feb 25 2000

EXTENSIONS

More terms from Matthew M. Conroy, May 13 2001

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