login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200947 Sequence A007924 expressed in decimals. 8
0, 1, 2, 4, 5, 8, 9, 16, 17, 18, 20, 32, 33, 64, 65, 66, 68, 128, 129, 256, 257, 258, 260, 512, 513, 514, 516, 517, 520, 1024, 1025, 2048, 2049, 2050, 2052, 2053, 2056, 4096, 4097, 4098, 4100, 8192, 8193, 16384, 16385, 16386, 16388, 32768, 32769, 32770 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

The sequence s(0)=1, and for n>0, s(n)=Prime(n) is complete. A007924 is a set of binary vectors for selecting the largest of either 1 or the primes that when added gives n. This sequence a(n) = decimal(A007924(n)).

LINKS

Table of n, a(n) for n=0..49.

Wikipedia, Complete sequence.

FORMULA

a(n) = decimal(A007924(n)).

EXAMPLE

8=7+1, hence A007924(8)=10001, so a(8)=17.

MATHEMATICA

cprime[n_Integer] := If[n==0, 1, Prime[n]]; gentable[n_Integer] := (m=n; ptable={}; While[m != 0, (i = 0; While[cprime[i] <= m, i++]; j=0; While[j<i, AppendTo[ptable, 0]; j++]; ptable[[i]]=1; m=m-cprime[i-1])]; ptable); decimal[n_Integer] := (gentable[n]; Sum[2^(k - 1)*ptable[[k]], {k, 1, Length[ptable]}]); Table[decimal[n], {n, 0, 100}]

CROSSREFS

Cf. A003714, A007895, A007924, A027941, A066352.

Sequence in context: A305076 A332223 A269361 * A333256 A227369 A092739

Adjacent sequences:  A200944 A200945 A200946 * A200948 A200949 A200950

KEYWORD

nonn

AUTHOR

Frank M Jackson, Nov 24 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 21 12:58 EDT 2021. Contains 345364 sequences. (Running on oeis4.)