login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089739 Let b(m)= base ten expansion of prime(n); then a(n)=Sum[Mod(10-b(l),10)*10^l,{l,1,10}]. 0
9, 8, 7, 5, 3, 99, 97, 93, 91, 87, 81, 79, 73, 69, 67, 63, 57, 51, 49, 43, 39, 37, 31, 27, 21, 13, 909, 907, 903, 901, 997, 983, 979, 973, 971, 961, 959, 953, 947, 943, 937, 931, 929, 919, 917, 913, 911, 899, 887, 883, 881, 877, 871, 869, 859, 853, 847, 841, 839, 833 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
PROG
(True BASIC)
100 to 300 prime sieve into p(n)
301 DIM a( 0 to 10)
302 open #1: name "CM1:Pmod10R_data", create newold, org text
310 FOR n=1 to 200
311 LET a0=p(n)
320 FOR m=0 to 10
330 Rem digit 10 vecxtor
331 LET a(m)=mod(a0, 10)
340 LET a0=(a0-a(m))/10
350 NEXT m
351 LET s=0
352 rem make 10's complement of prime numbers
360 FOR l=0 to 10
370 LET s=s+Mod(10-a(l), 10)*10^l
380 NEXT l
390 PRINT #1: s; ", ";
400 NEXT n
401 close #1
460 END
CROSSREFS
Sequence in context: A334448 A011116 A106334 * A199264 A022965 A023451
KEYWORD
nonn,base,less
AUTHOR
Roger L. Bagula, Jan 07 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 18:16 EDT 2024. Contains 374285 sequences. (Running on oeis4.)