Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061987
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061987 Number of times n-th distinct value is repeated in sequence b(k) = 1 + b([k/2]) + b([k/3]) with b(0) = 0 i.e. in A061984; also number of times n-th distinct row is repeated in square array T(n,k) = T(n-1,k) + T(n-1,[k/2]) + T(n-1,[k/3]) with T(0,0) = 1 i.e. in A061980. +0
12
1, 1, 1, 1, 2, 2, 1, 3, 4, 2, 6, 3, 5, 4, 12, 6, 10, 8, 9, 15, 12, 20, 16, 18, 30, 24, 27, 13, 32, 36, 60, 48, 54, 26, 64, 72, 81, 39, 96, 108, 52, 128, 144, 162, 78, 192, 216, 104, 139, 117, 288, 324, 156, 384, 432, 208, 278, 234, 576, 648, 312, 417, 351, 864, 416, 556 (list; graph; listen)
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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research