Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125286
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125286 a(0)=1. a(n) = a(n-1) + (the largest term among {a(0),a(1),...a(n-1)} that has the same number of positive divisors as n). +0
1
1, 2, 4, 6, 10, 12, 22, 24, 46, 50, 96, 98, 196, 198, 244, 290 (list; graph; listen)
OFFSET

0,2

COMMENT

a(16) does not exist because no earlier term has exactly 5 divisors. However, arbitrary modifications of the sequence's definition (such as letting a(n) = a(n-1) + 0 if no earlier term has the same number of divisors as n, or letting a(n) = a(n-1) + the largest earlier term with at most n divisors, etc) would allow the sequence to be infinite in length.

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

9 has 3 divisors. So a(9) = a(8) + the largest earlier term with 3 divisors. a(3) = 4 is the only earlier term with 3 divisors, so a(9) = a(8) + 4 = 50.

CROSSREFS

Sequence in context: A133871 A068514 A074645 this_sequence A045963 A128169 A095923

Adjacent sequences: A125283 A125284 A125285 this_sequence A125287 A125288 A125289

KEYWORD

fini,full,nonn

AUTHOR

Leroy Quet Jan 26 2007

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 19:35 EST 2009. Contains 170826 sequences.


AT&T Labs Research