A285884 For n => 1, the number of distinct summands u and v that can be used in the representation of n as u+v, where u and v are two (possibly equal) Ulam numbers A002858.
0, 1, 2, 3, 4, 3, 4, 3, 4, 4, 2, 5, 2, 6, 4, 3, 6, 2, 8, 4, 4, 5, 0, 6, 0, 3, 4, 2, 8, 4, 4, 5, 0, 6, 0, 3, 4, 2, 8, 4, 4, 6, 0, 8, 0, 4, 2, 2, 8, 4, 6, 5, 2, 10, 4, 7, 2, 4, 6, 4, 6, 2, 6, 10, 6, 8, 0, 4, 2, 6, 4, 3, 10, 6, 10, 5, 2, 6, 4, 8, 4, 2, 10, 4, 12
Offset: 1
Keywords
Examples
a(23) = 0 since 23 can't be written as the sum of two distinct Ulam numbers. This type of numbers are in A033629. a(94) = 1 since 94 = 47 + 47, where 47 is an Ulam number. This type of numbers are in A287611. a(11) = 2 since 11 has the unique representation 11 = 8 + 3, where 8,3 are Ulam numbers. If such n is also an Ulam number (such as 11), then it is in A002858. a(8) = 3 since it has the representation 8 = 6 + 2 and also the additional "pseudo-representation" 8 = 4 + 4, where 6, 2, and 4 are Ulam numbers. If n has such a "pseudo-representation" and is an Ulam number, then it is in A068799.
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..10000
- Rémy Sigrist, C program for A285884
- Rémy Sigrist, Density plot of the first 2500000 terms
Programs
-
C
See Links section.
Comments