Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002048
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002048 Segmented numbers, or prime numbers of measurement.
(Formerly M0972 N0363)
+0
5
1, 2, 4, 5, 8, 10, 14, 15, 16, 21, 22, 25, 26, 28, 33, 34, 35, 36, 38, 40, 42, 46, 48, 49, 50, 53, 57, 60, 62, 64, 65, 70, 77, 80, 81, 83, 85, 86, 90, 91, 92, 100, 104, 107, 108, 116, 119, 124, 127, 132, 133, 137, 141, 144, 145, 148, 150, 151, 154, 158, 159, 163, 165 (list; graph; listen)
OFFSET

1,2

REFERENCES

G. E. Andrews, MacMahon's prime numbers of measurement, Amer. Math. Monthly, 82 (1975), 922-923.

R. K. Guy, Unsolved Problems in Number Theory, E30.

P. A. MacMahon, The prime numbers of measurement on a scale, Proc. Camb. Phil. Soc. 21 (1923), 651-654; reprinted in Coll. Papers I, pp. 797-800.

Problem E1910, Amer. Math. Monthly, 75 (1968), 80-81.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

R. J. Mathar, Table of n, a(n) for n = 1..7836

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

MAPLE

(Maple program from R. J. Mathar, Jun 04 2006) A002048 := proc(anmax::integer, printlist::boolean)

local a, asum, su, i, piv, j;

a := [];

for i from 1 to anmax do

a := [op(a), i];

od:

if printlist then

printf("%d %d\n", 1, a[1]);

printf("%d %d\n", 2, a[2]);

fi;

asum := [a[1]+a[2], a[2]];

for i from 3 to anmax do

asum := [op(asum), 0];

od:

piv := 3;

while piv <= nops(a) do

for i from 1 to piv-2 do

a := remove(has, a, asum[i]);

od:

if printlist then

printf("%a %a\n", piv, a[piv]);

fi;

for i from 1 to piv do

asum := subsop(i=asum[i]+a[piv], asum);

od:

piv := piv+1;

od;

RETURN(a);

end:

A002048(40000, true);

PROGRAM

(C++) #include <iostream> #include <vector> #include <algorithm> #define NMAX 400 using namespace std; int main(int argc, char *argv[]) { vector<int> a; for(int i=0; i< NMAX; i++) a.push_back(i+1); for(int piv=2; piv < a.size(); piv++) for(int i=0; i < piv-1 && i < a.size()-1; i++) { int su= a[i]+a[i+1]; remove(a.begin(), a.end(), su); for(int j=i+2; j < piv && j < a.size(); j++) { su += a[j]; remove(a.begin(), a.end(), su); if(su > NMAX) break; } } for(int i=0; i < a.size() && a[i] < NMAX; i++) cout << a[i] << ", "; return 0; } - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 31 2006

CROSSREFS

Cf. A002049.

Sequence in context: A057129 A036404 A018498 this_sequence A067941 A092265 A163295

Adjacent sequences: A002045 A002046 A002047 this_sequence A002049 A002050 A002051

KEYWORD

nonn,nice

AUTHOR

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

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 31 2006

page 1

Search completed in 0.004 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