Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027750
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027750 Triangle read by rows in which row n list the divisors of n. +0
51
1, 1, 2, 1, 3, 1, 2, 4, 1, 5, 1, 2, 3, 6, 1, 7, 1, 2, 4, 8, 1, 3, 9, 1, 2, 5, 10, 1, 11, 1, 2, 3, 4, 6, 12, 1, 13, 1, 2, 7, 14, 1, 3, 5, 15, 1, 2, 4, 8, 16, 1, 17, 1, 2, 3, 6, 9, 18, 1, 19, 1, 2, 4, 5, 10, 20, 1, 3, 7, 21, 1, 2, 11, 22, 1, 23, 1, 2, 3, 4, 6, 8, 12, 24, 1, 5, 25, 1, 2, 13, 26, 1, 3, 9, 27, 1, 2, 4, 7, 14, 28, 1, 29 (list; graph; listen)
OFFSET

1,3

COMMENT

Or, in the list of natural numbers (A000027), replace n by its divisors.

This gives the first elements of the ordered pairs (a,b) a >= 1, b >= 1 ordered by their product ab.

Also, row n lists the largest parts of the partitions of n whose parts are not distinct. [From Omar E. Pol (info(AT)polprimos.com), Sep 17 2008]

LINKS

Franklin T. Adams-Watters, Rows 1 ... 1000, flattened

Franklin T. Adams-Watters, Rows 1 to 10000

Eric Weisstein's World of Mathematics, Divisor

O. E. Pol, A shell model of partitions [From Omar E. Pol (info(AT)polprimos.com), Sep 17 2008]

O. E. Pol, A 3D model of the divisors of the natural numbers [From Omar E. Pol (info(AT)polprimos.com), Oct 22 2009]

O. E. Pol, Illustration of initial terms [From Omar E. Pol (info(AT)polprimos.com), Oct 22 2009]

FORMULA

a(A006218(n-1) + k) = k-divisor of n, 1<=k<=A000005(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 10 2006

EXAMPLE

1; 1,2; 1,3; 1,2,4; 1,5; 1,2,3,6; ...

[From Omar E. Pol (info(AT)polprimos.com), Sep 17 2008]

MATHEMATICA

Flatten[ Table[ Flatten [ Divisors[ n ] ], {n, 1, 30} ] ]

PROGRAM

(MAGMA) [Divisors(n) : n in [1..20]];

(Other) sage: [divisors(n) for n in xrange(1, 30)] # view:[[1], [1, 2], [1, 3], [1, 2, 4], [1, 5], [1, 2, 3, 6], [1, 7], [1, 2, 4, 8], [1, 3, 9], [1, 2, 5, 10], [1, 11], [1, 2, 3, 4, 6, 12], [1, 13], [1, 2, 7, 14], [1, 3, 5, 15], etc... [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 24 2009]

CROSSREFS

Cf. A056534, A056538, A027751.

Cf. A135010, A138121. [From Omar E. Pol (info(AT)polprimos.com), Sep 17 2008]

A161700. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2009]

Cf. A000005, A163280. [From Omar E. Pol (info(AT)polprimos.com), Oct 22 2009]

Adjacent sequences: A027747 A027748 A027749 this_sequence A027751 A027752 A027753

Sequence in context: A165416 A057059 A162306 this_sequence A087295 A130517 A056951

KEYWORD

nonn,easy,tabf,new

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Scott Lindhurst (ScottL(AT)alumni.princeton.edu)

page 1

Search completed in 0.003 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 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research